/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:36:38,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:36:38,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:36:38,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:36:38,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:36:38,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:36:38,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:36:38,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:36:38,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:36:38,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:36:38,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:36:38,640 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:36:38,641 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:36:38,646 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:36:38,646 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:36:38,646 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:36:38,646 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:36:38,646 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:36:38,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:36:38,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:36:38,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:36:38,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:36:38,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:36:38,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:36:38,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:36:38,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:36:38,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:36:38,649 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:36:38,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:36:38,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:36:38,649 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:36:38,649 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:36:38,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:36:38,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:36:38,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:36:38,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:36:38,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:36:38,651 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:36:38,651 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:36:38,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:36:38,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:36:38,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:36:38,923 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:36:38,924 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:36:38,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl [2024-02-10 01:36:38,925 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl' [2024-02-10 01:36:38,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:36:38,961 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:36:38,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:36:38,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:36:38,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:36:38,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/1) ... [2024-02-10 01:36:38,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/1) ... [2024-02-10 01:36:38,986 INFO L138 Inliner]: procedures = 4, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:36:38,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:36:38,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:36:38,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:36:38,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:36:39,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/1) ... [2024-02-10 01:36:39,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/1) ... [2024-02-10 01:36:39,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/1) ... [2024-02-10 01:36:39,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/1) ... [2024-02-10 01:36:39,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/1) ... [2024-02-10 01:36:39,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/1) ... [2024-02-10 01:36:39,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/1) ... [2024-02-10 01:36:39,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/1) ... [2024-02-10 01:36:39,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:36:39,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:36:39,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:36:39,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:36:39,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/1) ... [2024-02-10 01:36:39,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:39,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:39,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:36:39,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 01:36:39,250 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-10 01:36:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-10 01:36:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-10 01:36:39,250 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:36:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:36:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:36:39,250 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 01:36:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 01:36:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 01:36:39,251 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-10 01:36:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-10 01:36:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-10 01:36:39,252 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:36:39,295 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:36:39,297 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:36:39,441 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:36:39,452 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:36:39,452 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-10 01:36:39,454 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:36:39 BoogieIcfgContainer [2024-02-10 01:36:39,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:36:39,455 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:36:39,455 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:36:39,483 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:36:39,484 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:36:39,484 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:38" (1/2) ... [2024-02-10 01:36:39,486 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45b42bb5 and model type min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:36:39, skipping insertion in model container [2024-02-10 01:36:39,486 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:36:39,486 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:36:39" (2/2) ... [2024-02-10 01:36:39,487 INFO L332 chiAutomizerObserver]: Analyzing ICFG min2-max2-sample.bpl [2024-02-10 01:36:39,573 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-10 01:36:39,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 130 flow [2024-02-10 01:36:39,621 INFO L124 PetriNetUnfolderBase]: 5/39 cut-off events. [2024-02-10 01:36:39,621 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-10 01:36:39,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 39 events. 5/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-02-10 01:36:39,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 130 flow [2024-02-10 01:36:39,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 105 flow [2024-02-10 01:36:39,635 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:36:39,635 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:36:39,635 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:36:39,635 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:36:39,635 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:36:39,635 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:36:39,636 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:36:39,636 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:36:39,636 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:39,637 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 50 places, 39 transitions, 105 flow [2024-02-10 01:36:39,982 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 6229 states, 6227 states have (on average 4.922916332102136) internal successors, (30655), 6228 states have internal predecessors, (30655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:36:40,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6229 states, 6227 states have (on average 4.922916332102136) internal successors, (30655), 6228 states have internal predecessors, (30655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:36:40,336 INFO L131 ngComponentsAnalysis]: Automaton has 1664 accepting balls. 5544 [2024-02-10 01:36:40,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:36:40,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:36:40,341 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:36:40,342 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:40,342 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 50 places, 39 transitions, 105 flow [2024-02-10 01:36:40,609 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 6229 states, 6227 states have (on average 4.922916332102136) internal successors, (30655), 6228 states have internal predecessors, (30655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:36:40,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6229 states, 6227 states have (on average 4.922916332102136) internal successors, (30655), 6228 states have internal predecessors, (30655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:36:40,837 INFO L131 ngComponentsAnalysis]: Automaton has 1664 accepting balls. 5544 [2024-02-10 01:36:40,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:36:40,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:36:40,844 INFO L748 eck$LassoCheckResult]: Stem: Black: 12518#[$Ultimate##0]don't care [98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0] 12521#[L69, $Ultimate##0]don't care [84] $Ultimate##0-->L33: Formula: (= v_array_min_6 0) InVars {} OutVars{array_min=v_array_min_6} AuxVars[] AssignedVars[array_min] 12525#[L69, L33]don't care [85] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1] 12533#[L69, L36-1]don't care [2024-02-10 01:36:40,845 INFO L750 eck$LassoCheckResult]: Loop: 12533#[L69, L36-1]don't care [87] L36-1-->L36: Formula: (< v_i1_2 v_N_3) InVars {i1=v_i1_2, N=v_N_3} OutVars{i1=v_i1_2, N=v_N_3} AuxVars[] AssignedVars[] 12551#[L69, L36]don't care [89] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0)))) InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8} OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7} AuxVars[] AssignedVars[array_min, i1] 12533#[L69, L36-1]don't care [2024-02-10 01:36:40,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:40,856 INFO L85 PathProgramCache]: Analyzing trace with hash 126658, now seen corresponding path program 1 times [2024-02-10 01:36:40,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:40,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309098411] [2024-02-10 01:36:40,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:40,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:40,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:40,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:40,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2024-02-10 01:36:40,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:40,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996737875] [2024-02-10 01:36:40,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:40,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:40,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:41,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:41,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash 121721124, now seen corresponding path program 1 times [2024-02-10 01:36:41,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:41,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824082442] [2024-02-10 01:36:41,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:41,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:41,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:41,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:41,188 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:36:41,188 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:36:41,188 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:36:41,188 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:36:41,188 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:36:41,188 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:41,189 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:36:41,189 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:36:41,189 INFO L133 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:36:41,189 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:36:41,189 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:36:41,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:36:41,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:36:41,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:36:41,348 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:36:41,351 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:36:41,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:41,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:41,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:36:41,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:36:41,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 01:36:41,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:36:41,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:36:41,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:36:41,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:36:41,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:36:41,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:36:41,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:36:41,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 01:36:41,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:41,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:41,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:36:41,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 01:36:41,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:36:41,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:36:41,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:36:41,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:36:41,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:36:41,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:36:41,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:36:41,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:36:41,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:36:41,453 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 01:36:41,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:41,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:41,469 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:36:41,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:36:41,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 01:36:41,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:36:41,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:36:41,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:36:41,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:36:41,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:36:41,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:36:41,507 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:36:41,528 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:36:41,529 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:36:41,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:41,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:41,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:36:41,537 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:36:41,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 01:36:41,553 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:36:41,553 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:36:41,554 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2024-02-10 01:36:41,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-10 01:36:41,561 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:36:41,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:36:41,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:36:41,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:36:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:36:41,605 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:36:41,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:36:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:36:41,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 01:36:41,694 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 01:36:41,695 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:36:41,891 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 617 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:36:41,892 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:36:41,893 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:36:41,905 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:36:41,906 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:36:41,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:36:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:36:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-02-10 01:36:41,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 3 letters. Loop has 2 letters. [2024-02-10 01:36:41,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:41,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-10 01:36:41,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:41,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 3 letters. Loop has 4 letters. [2024-02-10 01:36:41,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:41,929 INFO L428 stractBuchiCegarLoop]: Abstraction has has 68 places, 974 transitions, 4598 flow [2024-02-10 01:36:41,929 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:36:41,929 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:41,929 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 68 places, 974 transitions, 4598 flow [2024-02-10 01:36:44,764 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 31531 states, 31507 states have (on average 6.008156917510394) internal successors, (189299), 31530 states have internal predecessors, (189299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:36:44,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31531 states, 31507 states have (on average 6.008156917510394) internal successors, (189299), 31530 states have internal predecessors, (189299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:36:45,905 INFO L131 ngComponentsAnalysis]: Automaton has 5718 accepting balls. 16952 [2024-02-10 01:36:45,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:36:45,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:36:45,910 INFO L748 eck$LassoCheckResult]: Stem: Black: 25026#[$Ultimate##0]don't care [98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0] Black: 25029#[$Ultimate##0, L69]don't care [101] L69-->$Ultimate##0: Formula: (and (= v_computeMinThread1of1ForFork1_thidvar0_2 2) (= v_computeMinThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMinThread1of1ForFork1_x=v_computeMinThread1of1ForFork1_x_2, computeMinThread1of1ForFork1_thidvar0=v_computeMinThread1of1ForFork1_thidvar0_2, computeMinThread1of1ForFork1_thidvar1=v_computeMinThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork1_x, computeMinThread1of1ForFork1_thidvar0, computeMinThread1of1ForFork1_thidvar1] Black: 25039#[L70, $Ultimate##0, $Ultimate##0]don't care [90] $Ultimate##0-->L33: Formula: (= v_array_min_6 0) InVars {} OutVars{array_min=v_array_min_6} AuxVars[] AssignedVars[array_min] Black: 25061#[L33, L70, $Ultimate##0]don't care [91] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1] 25114#[L70, $Ultimate##0, L36-1]don't care [2024-02-10 01:36:45,910 INFO L750 eck$LassoCheckResult]: Loop: 25114#[L70, $Ultimate##0, L36-1]don't care [93] L36-1-->L36: Formula: (< v_i1_2 v_N_3) InVars {i1=v_i1_2, N=v_N_3} OutVars{i1=v_i1_2, N=v_N_3} AuxVars[] AssignedVars[] Black: 25242#[L36, L70, $Ultimate##0]don't care [95] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0)))) InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8} OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7} AuxVars[] AssignedVars[array_min, i1] 25114#[L70, $Ultimate##0, L36-1]don't care [2024-02-10 01:36:45,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:45,911 INFO L85 PathProgramCache]: Analyzing trace with hash 3942981, now seen corresponding path program 1 times [2024-02-10 01:36:45,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:45,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611368852] [2024-02-10 01:36:45,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:45,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:45,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:45,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:45,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2024-02-10 01:36:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:45,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530259217] [2024-02-10 01:36:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:45,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:45,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:45,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash -505759577, now seen corresponding path program 1 times [2024-02-10 01:36:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:45,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719917438] [2024-02-10 01:36:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:45,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:45,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:46,135 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:36:46,135 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:36:46,135 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:36:46,135 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:36:46,135 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:36:46,135 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:46,135 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:36:46,136 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:36:46,136 INFO L133 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:36:46,136 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:36:46,136 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:36:46,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:36:46,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:36:46,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:36:46,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:36:46,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:36:46,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:36:46,249 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:36:46,250 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:36:46,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:46,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:46,251 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:36:46,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 01:36:46,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:36:46,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:36:46,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:36:46,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:36:46,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:36:46,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:36:46,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:36:46,308 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:36:46,312 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 01:36:46,312 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:36:46,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:46,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:46,337 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:36:46,342 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:36:46,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 01:36:46,373 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:36:46,373 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:36:46,373 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2024-02-10 01:36:46,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 01:36:46,391 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:36:46,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:36:46,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:36:46,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:36:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:36:46,416 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:36:46,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:36:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:36:46,427 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 01:36:46,428 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 01:36:46,518 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 617 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:36:46,518 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:36:46,519 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:36:46,629 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:36:46,629 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:36:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:36:46,630 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 01:36:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-02-10 01:36:46,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 4 letters. Loop has 2 letters. [2024-02-10 01:36:46,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:46,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 6 letters. Loop has 2 letters. [2024-02-10 01:36:46,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:46,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 4 letters. Loop has 4 letters. [2024-02-10 01:36:46,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:46,632 INFO L428 stractBuchiCegarLoop]: Abstraction has has 86 places, 24628 transitions, 166020 flow [2024-02-10 01:36:46,632 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:36:46,632 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:46,632 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 86 places, 24628 transitions, 166020 flow [2024-02-10 01:36:47,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 01:38:49,293 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 74010 states, 73939 states have (on average 6.932687756123291) internal successors, (512596), 74009 states have internal predecessors, (512596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:38:49,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 74010 states, 73939 states have (on average 6.932687756123291) internal successors, (512596), 74009 states have internal predecessors, (512596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:38:51,467 INFO L131 ngComponentsAnalysis]: Automaton has 6624 accepting balls. 17256 [2024-02-10 01:38:51,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:38:51,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:38:51,471 INFO L748 eck$LassoCheckResult]: Stem: Black: 109446#[$Ultimate##0]don't care [98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0] Black: 109457#[$Ultimate##0, L69]don't care [101] L69-->$Ultimate##0: Formula: (and (= v_computeMinThread1of1ForFork1_thidvar0_2 2) (= v_computeMinThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMinThread1of1ForFork1_x=v_computeMinThread1of1ForFork1_x_2, computeMinThread1of1ForFork1_thidvar0=v_computeMinThread1of1ForFork1_thidvar0_2, computeMinThread1of1ForFork1_thidvar1=v_computeMinThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork1_x, computeMinThread1of1ForFork1_thidvar0, computeMinThread1of1ForFork1_thidvar1] 109493#[L70, $Ultimate##0, $Ultimate##0]don't care [104] L70-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork2_thidvar2_2 3) (= v_computeMaxThread1of1ForFork2_thidvar0_2 3) (= v_computeMaxThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{computeMaxThread1of1ForFork2_y=v_computeMaxThread1of1ForFork2_y_2, computeMaxThread1of1ForFork2_thidvar2=v_computeMaxThread1of1ForFork2_thidvar2_2, computeMaxThread1of1ForFork2_thidvar1=v_computeMaxThread1of1ForFork2_thidvar1_2, computeMaxThread1of1ForFork2_thidvar0=v_computeMaxThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork2_y, computeMaxThread1of1ForFork2_thidvar2, computeMaxThread1of1ForFork2_thidvar1, computeMaxThread1of1ForFork2_thidvar0] Black: 109564#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L71]don't care [75] $Ultimate##0-->L47: Formula: (= v_array_max_1 0) InVars {} OutVars{array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] Black: 109619#[$Ultimate##0, L47, $Ultimate##0, L71]don't care [76] L47-->L50-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2] 109811#[L50-1, $Ultimate##0, $Ultimate##0, L71]don't care [2024-02-10 01:38:51,472 INFO L750 eck$LassoCheckResult]: Loop: 109811#[L50-1, $Ultimate##0, $Ultimate##0, L71]don't care [78] L50-1-->L50: Formula: (< v_i2_2 v_N_1) InVars {i2=v_i2_2, N=v_N_1} OutVars{i2=v_i2_2, N=v_N_1} AuxVars[] AssignedVars[] Black: 110289#[$Ultimate##0, $Ultimate##0, L50, L71]don't care [80] L50-->L50-1: Formula: (and (= v_i2_8 (+ v_i2_9 1)) (= v_array_max_7 (let ((.cse0 (select v_A_3 v_i2_9))) (ite (< v_array_max_8 .cse0) .cse0 v_array_max_8)))) InVars {A=v_A_3, i2=v_i2_9, array_max=v_array_max_8} OutVars{A=v_A_3, i2=v_i2_8, array_max=v_array_max_7} AuxVars[] AssignedVars[array_max, i2] 109811#[L50-1, $Ultimate##0, $Ultimate##0, L71]don't care [2024-02-10 01:38:51,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:38:51,476 INFO L85 PathProgramCache]: Analyzing trace with hash 122245445, now seen corresponding path program 1 times [2024-02-10 01:38:51,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:38:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336272585] [2024-02-10 01:38:51,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:38:51,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:38:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:38:51,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:38:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:38:51,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:38:51,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:38:51,494 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2024-02-10 01:38:51,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:38:51,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474864882] [2024-02-10 01:38:51,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:38:51,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:38:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:38:51,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:38:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:38:51,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:38:51,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:38:51,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1513758151, now seen corresponding path program 1 times [2024-02-10 01:38:51,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:38:51,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517072989] [2024-02-10 01:38:51,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:38:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:38:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:38:51,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:38:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:38:51,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:38:51,569 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:38:51,569 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:38:51,569 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:38:51,569 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:38:51,569 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:38:51,569 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:38:51,569 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:38:51,570 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:38:51,570 INFO L133 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration3_Lasso [2024-02-10 01:38:51,570 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:38:51,570 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:38:51,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:38:51,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:38:51,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:38:51,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:38:51,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:38:51,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:38:51,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:38:51,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:38:51,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:38:51,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:38:51,706 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:38:51,706 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:38:51,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:38:51,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:38:51,737 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:38:51,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 01:38:51,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:38:51,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:38:51,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:38:51,751 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 01:38:51,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:38:51,761 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-10 01:38:51,761 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 01:38:51,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:38:51,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 01:38:51,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:38:51,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:38:51,800 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:38:51,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:38:51,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:38:51,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:38:51,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:38:51,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:38:51,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:38:51,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:38:51,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 01:38:51,823 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:38:51,826 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:38:51,826 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:38:51,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:38:51,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:38:51,828 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:38:51,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 01:38:51,830 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:38:51,852 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:38:51,852 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:38:51,852 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2024-02-10 01:38:51,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-02-10 01:38:51,857 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:38:51,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:38:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:38:51,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:38:51,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:38:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:38:51,885 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:38:51,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:38:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:38:51,894 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 01:38:51,895 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 01:38:51,998 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 617 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:38:51,998 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:38:51,998 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:38:52,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-02-10 01:38:57,054 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:38:57,055 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:38:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:38:57,057 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 01:38:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-02-10 01:38:57,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-10 01:38:57,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:38:57,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 7 letters. Loop has 2 letters. [2024-02-10 01:38:57,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:38:57,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-10 01:38:57,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:38:57,058 INFO L428 stractBuchiCegarLoop]: Abstraction has has 104 places, 613288 transitions, 5380856 flow [2024-02-10 01:38:57,059 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:38:57,059 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:38:57,059 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 104 places, 613288 transitions, 5380856 flow Received shutdown request... [2024-02-10 01:40:49,672 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 01:40:49,741 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:40:49,746 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:40:49 BoogieIcfgContainer [2024-02-10 01:40:49,746 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:40:49,747 INFO L158 Benchmark]: Toolchain (without parser) took 250785.87ms. Allocated memory was 158.3MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 95.7MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2024-02-10 01:40:49,747 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 158.3MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:40:49,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 158.3MB. Free memory was 95.3MB in the beginning and 93.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:40:49,748 INFO L158 Benchmark]: Boogie Preprocessor took 72.42ms. Allocated memory is still 158.3MB. Free memory was 93.9MB in the beginning and 128.8MB in the end (delta: -34.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-02-10 01:40:49,748 INFO L158 Benchmark]: RCFGBuilder took 392.75ms. Allocated memory is still 158.3MB. Free memory was 128.8MB in the beginning and 118.5MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 01:40:49,748 INFO L158 Benchmark]: BuchiAutomizer took 250291.32ms. Allocated memory was 158.3MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 118.5MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2024-02-10 01:40:49,750 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10ms. Allocated memory is still 158.3MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 158.3MB. Free memory was 95.3MB in the beginning and 93.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.42ms. Allocated memory is still 158.3MB. Free memory was 93.9MB in the beginning and 128.8MB in the end (delta: -34.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 392.75ms. Allocated memory is still 158.3MB. Free memory was 128.8MB in the beginning and 118.5MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 250291.32ms. Allocated memory was 158.3MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 118.5MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 * i1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 5 locations. The remainder module has 5380856 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 250.1s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 5.6s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 398 mSDsluCounter, 495 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 377 IncrementalHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 270 mSDtfsCounter, 377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital51 mio100 ax100 hnf100 lsp123 ukn54 mio100 lsp58 div100 bol100 ite100 ukn100 eq160 hnf100 smp100 dnf162 smp57 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 78ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing BuchiPetriNet2FiniteAutomaton. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2024-02-10 01:40:49,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0