/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/min2-max2-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:27:50,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:27:50,382 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:50,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:27:50,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:27:50,388 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:50,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:27:50,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:27:50,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:27:50,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:27:50,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:27:50,429 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:27:50,429 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:27:50,430 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:27:50,430 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:27:50,430 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:27:50,431 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:27:50,431 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:27:50,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:27:50,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:27:50,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:27:50,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:27:50,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:27:50,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:27:50,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:27:50,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:27:50,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:27:50,441 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:27:50,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:27:50,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:27:50,442 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:27:50,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:27:50,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:27:50,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:27:50,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:27:50,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:27:50,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:27:50,444 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:27:50,444 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:50,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:27:50,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:27:50,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:27:50,810 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:27:50,811 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:27:50,812 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 00:27:50,813 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl' [2024-02-10 00:27:50,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:27:50,839 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:27:50,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:27:50,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:27:50,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:27:50,869 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 12:27:50" (1/1) ... [2024-02-10 00:27:50,876 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 12:27:50" (1/1) ... [2024-02-10 00:27:50,882 INFO L138 Inliner]: procedures = 4, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:27:50,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:27:50,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:27:50,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:27:50,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:27:50,907 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 12:27:50" (1/1) ... [2024-02-10 00:27:50,907 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 12:27:50" (1/1) ... [2024-02-10 00:27:50,908 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 12:27:50" (1/1) ... [2024-02-10 00:27:50,908 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 12:27:50" (1/1) ... [2024-02-10 00:27:50,910 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 12:27:50" (1/1) ... [2024-02-10 00:27:50,913 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 12:27:50" (1/1) ... [2024-02-10 00:27:50,914 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 12:27:50" (1/1) ... [2024-02-10 00:27:50,915 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 12:27:50" (1/1) ... [2024-02-10 00:27:50,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:27:50,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:27:50,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:27:50,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:27:50,921 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 12:27:50" (1/1) ... [2024-02-10 00:27:50,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:50,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:51,073 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:51,076 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:51,138 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-10 00:27:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-10 00:27:51,140 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-10 00:27:51,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:27:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:27:51,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:27:51,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 00:27:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 00:27:51,141 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 00:27:51,141 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-10 00:27:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-10 00:27:51,141 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-10 00:27:51,142 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:51,211 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:27:51,213 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:27:51,343 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:27:51,357 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:27:51,357 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-10 00:27:51,359 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:27:51 BoogieIcfgContainer [2024-02-10 00:27:51,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:27:51,360 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:27:51,361 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:27:51,367 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:27:51,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:27:51,368 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 12:27:50" (1/2) ... [2024-02-10 00:27:51,370 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cd3cfad and model type min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:27:51, skipping insertion in model container [2024-02-10 00:27:51,370 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:27:51,370 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 12:27:51" (2/2) ... [2024-02-10 00:27:51,371 INFO L332 chiAutomizerObserver]: Analyzing ICFG min2-max2-sample.bpl [2024-02-10 00:27:51,444 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-10 00:27:51,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 130 flow [2024-02-10 00:27:51,493 INFO L124 PetriNetUnfolderBase]: 5/39 cut-off events. [2024-02-10 00:27:51,493 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-10 00:27:51,498 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 00:27:51,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 130 flow [2024-02-10 00:27:51,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 105 flow [2024-02-10 00:27:51,509 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:27:51,509 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:27:51,509 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:27:51,510 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:27:51,510 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:27:51,510 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:27:51,510 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:27:51,510 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:27:51,510 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:51,511 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 50 places, 39 transitions, 105 flow [2024-02-10 00:27:51,857 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 00:27:51,903 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 00:27:52,182 INFO L131 ngComponentsAnalysis]: Automaton has 1664 accepting balls. 5544 [2024-02-10 00:27:52,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:52,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:52,189 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:27:52,189 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:52,190 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 50 places, 39 transitions, 105 flow [2024-02-10 00:27:52,432 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 00:27:52,465 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 00:27:52,630 INFO L131 ngComponentsAnalysis]: Automaton has 1664 accepting balls. 5544 [2024-02-10 00:27:52,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:52,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:52,636 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 00:27:52,638 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 00:27:52,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:52,644 INFO L85 PathProgramCache]: Analyzing trace with hash 126658, now seen corresponding path program 1 times [2024-02-10 00:27:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:52,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511489950] [2024-02-10 00:27:52,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:52,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:52,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2024-02-10 00:27:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313965927] [2024-02-10 00:27:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:52,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash 121721124, now seen corresponding path program 1 times [2024-02-10 00:27:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:52,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338823106] [2024-02-10 00:27:52,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:52,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:52,978 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:27:52,978 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:27:52,979 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:27:52,979 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:27:52,979 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:27:52,979 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:52,979 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:27:52,979 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:27:52,979 INFO L133 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:27:52,979 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:27:52,979 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:27:52,994 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:53,007 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:53,010 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:53,187 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:27:53,191 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:27:53,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:53,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:53,194 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:53,200 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:53,200 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:53,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:53,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:53,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:53,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:53,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:53,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:53,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:53,248 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 00:27:53,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:53,254 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:53,255 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:53,256 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:53,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:53,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:27:53,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:53,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:53,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:53,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:27:53,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:27:53,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:53,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 00:27:53,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:53,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:53,271 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:53,276 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:53,276 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:53,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:53,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:53,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:53,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:53,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:53,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:53,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:27:53,320 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:27:53,321 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 00:27:53,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:53,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:53,324 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:53,343 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:53,343 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:27:53,377 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:27:53,377 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:27:53,378 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2024-02-10 00:27:53,386 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 00:27:53,389 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:27:53,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:53,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:27:53,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:53,455 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:27:53,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:53,481 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:53,529 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:53,531 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 00:27:53,745 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 00:27:53,746 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:27:53,746 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:27:53,747 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:27:53,807 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:27:53,807 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:27:53,809 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 00:27:53,811 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:53,816 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 00:27:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-02-10 00:27:53,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 3 letters. Loop has 2 letters. [2024-02-10 00:27:53,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:53,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-10 00:27:53,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:53,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 3 letters. Loop has 4 letters. [2024-02-10 00:27:53,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:53,825 INFO L428 stractBuchiCegarLoop]: Abstraction has has 59 places, 487 transitions, 2299 flow [2024-02-10 00:27:53,826 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:27:53,826 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:53,826 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 59 places, 487 transitions, 2299 flow [2024-02-10 00:27:55,720 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 21315 states, 21301 states have (on average 6.693676353222854) internal successors, (142582), 21314 states have internal predecessors, (142582), 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:55,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21315 states, 21301 states have (on average 6.693676353222854) internal successors, (142582), 21314 states have internal predecessors, (142582), 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,809 INFO L131 ngComponentsAnalysis]: Automaton has 2859 accepting balls. 8476 [2024-02-10 00:27:56,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:56,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:56,813 INFO L748 eck$LassoCheckResult]: Stem: Black: 25017#[$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] 25023#[$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] 25033#[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] 25046#[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] 25084#[L70, $Ultimate##0, L36-1]don't care [2024-02-10 00:27:56,814 INFO L750 eck$LassoCheckResult]: Loop: 25084#[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[] 25165#[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] 25084#[L70, $Ultimate##0, L36-1]don't care [2024-02-10 00:27:56,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash 3942981, now seen corresponding path program 1 times [2024-02-10 00:27:56,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:56,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309102959] [2024-02-10 00:27:56,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:56,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:56,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:56,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:56,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2024-02-10 00:27:56,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:56,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978596066] [2024-02-10 00:27:56,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:56,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:56,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:56,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:56,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash -505759577, now seen corresponding path program 1 times [2024-02-10 00:27:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:56,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495399492] [2024-02-10 00:27:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:56,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:56,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:56,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:57,044 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:27:57,044 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:27:57,044 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:27:57,044 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:27:57,044 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:27:57,044 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:57,045 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:27:57,045 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:27:57,045 INFO L133 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:27:57,045 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:27:57,045 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:27:57,048 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:57,080 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:57,082 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:57,085 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:57,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:27:57,091 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:57,187 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:27:57,187 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:27:57,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:57,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:57,189 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:57,204 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:57,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:57,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:57,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:57,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:57,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:57,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:57,227 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:57,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:27:57,237 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 00:27:57,237 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 00:27:57,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:57,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:57,239 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:57,242 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:57,242 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:27:57,258 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:27:57,259 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:27:57,259 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2024-02-10 00:27:57,265 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:57,266 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:27:57,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:57,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:27:57,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:57,301 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:27:57,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:57,316 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:57,317 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:57,318 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:57,460 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 00:27:57,461 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:27:57,461 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:27:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 617 transitions. [2024-02-10 00:27:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 617 transitions. [2024-02-10 00:27:57,481 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:27:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 617 transitions. [2024-02-10 00:27:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 617 transitions. [2024-02-10 00:27:57,615 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:57,856 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:27:57,856 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:27:57,857 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:57,858 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:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-02-10 00:27:57,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 4 letters. Loop has 2 letters. [2024-02-10 00:27:57,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:57,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 6 letters. Loop has 2 letters. [2024-02-10 00:27:57,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:57,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 4 letters. Loop has 4 letters. [2024-02-10 00:27:57,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:57,859 INFO L428 stractBuchiCegarLoop]: Abstraction has has 72 places, 8025 transitions, 54117 flow [2024-02-10 00:27:57,859 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:27:57,859 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:57,860 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 72 places, 8025 transitions, 54117 flow [2024-02-10 00:28:22,635 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 48478 states, 48434 states have (on average 7.360841557583516) internal successors, (356515), 48477 states have internal predecessors, (356515), 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:28:22,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48478 states, 48434 states have (on average 7.360841557583516) internal successors, (356515), 48477 states have internal predecessors, (356515), 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:28:23,539 INFO L131 ngComponentsAnalysis]: Automaton has 6624 accepting balls. 17256 [2024-02-10 00:28:23,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:23,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:23,545 INFO L748 eck$LassoCheckResult]: Stem: Black: 78784#[$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: 78787#[L69, $Ultimate##0]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: 78804#[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] 78846#[L71, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [107] L71-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork3_thidvar0_2 4) (= v_computeMaxThread1of1ForFork3_thidvar3_2 4) (= v_computeMaxThread1of1ForFork3_thidvar2_2 4) (= v_computeMaxThread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{computeMaxThread1of1ForFork3_thidvar3=v_computeMaxThread1of1ForFork3_thidvar3_2, computeMaxThread1of1ForFork3_y=v_computeMaxThread1of1ForFork3_y_2, computeMaxThread1of1ForFork3_thidvar1=v_computeMaxThread1of1ForFork3_thidvar1_2, computeMaxThread1of1ForFork3_thidvar2=v_computeMaxThread1of1ForFork3_thidvar2_2, computeMaxThread1of1ForFork3_thidvar0=v_computeMaxThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork3_thidvar3, computeMaxThread1of1ForFork3_y, computeMaxThread1of1ForFork3_thidvar1, computeMaxThread1of1ForFork3_thidvar2, computeMaxThread1of1ForFork3_thidvar0] Black: 78927#[L72, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [110] L72-->L60: Formula: (and (= 5 v_sampleThread1of1ForFork4_thidvar0_2) (= 5 v_sampleThread1of1ForFork4_thidvar1_2) (= 5 v_sampleThread1of1ForFork4_thidvar2_2) (= 5 v_sampleThread1of1ForFork4_thidvar4_2) (= 5 v_sampleThread1of1ForFork4_thidvar3_2)) InVars {} OutVars{sampleThread1of1ForFork4_thidvar4=v_sampleThread1of1ForFork4_thidvar4_2, sampleThread1of1ForFork4_thidvar3=v_sampleThread1of1ForFork4_thidvar3_2, sampleThread1of1ForFork4_thidvar2=v_sampleThread1of1ForFork4_thidvar2_2, sampleThread1of1ForFork4_thidvar1=v_sampleThread1of1ForFork4_thidvar1_2, sampleThread1of1ForFork4_thidvar0=v_sampleThread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[sampleThread1of1ForFork4_thidvar4, sampleThread1of1ForFork4_thidvar3, sampleThread1of1ForFork4_thidvar2, sampleThread1of1ForFork4_thidvar1, sampleThread1of1ForFork4_thidvar0] 79098#[L73, L60, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 00:28:23,545 INFO L750 eck$LassoCheckResult]: Loop: 79098#[L73, L60, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [82] L60-->L62: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_1) v_array_min_3)) InVars {min_samples=v_min_samples_2, i1=v_i1_1, array_min=v_array_min_3} OutVars{min_samples=v_min_samples_1, i1=v_i1_1, array_min=v_array_min_3} AuxVars[] AssignedVars[min_samples] Black: 79473#[$Ultimate##0, L73, L62, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [83] L62-->L60: Formula: (= (store v_max_samples_2 (+ (- 1) v_i2_7) v_array_max_6) v_max_samples_1) InVars {i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_2} OutVars{i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_1} AuxVars[] AssignedVars[max_samples] 79098#[L73, L60, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 00:28:23,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 122246471, now seen corresponding path program 1 times [2024-02-10 00:28:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:23,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900948647] [2024-02-10 00:28:23,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:23,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:23,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:23,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:23,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash 3586, now seen corresponding path program 1 times [2024-02-10 00:28:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:23,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703493175] [2024-02-10 00:28:23,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:23,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:23,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:23,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:23,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1514744264, now seen corresponding path program 1 times [2024-02-10 00:28:23,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:23,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637544697] [2024-02-10 00:28:23,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:23,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:23,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:23,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:23,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:23,762 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:28:23 BoogieIcfgContainer [2024-02-10 00:28:23,763 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:28:23,764 INFO L158 Benchmark]: Toolchain (without parser) took 32924.58ms. Allocated memory was 162.5MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 101.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-02-10 00:28:23,764 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 162.5MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:28:23,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.69ms. Allocated memory is still 162.5MB. Free memory was 101.2MB in the beginning and 134.1MB in the end (delta: -32.9MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2024-02-10 00:28:23,765 INFO L158 Benchmark]: Boogie Preprocessor took 31.72ms. Allocated memory was 162.5MB in the beginning and 262.1MB in the end (delta: 99.6MB). Free memory was 134.1MB in the beginning and 233.2MB in the end (delta: -99.1MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2024-02-10 00:28:23,766 INFO L158 Benchmark]: RCFGBuilder took 442.54ms. Allocated memory is still 262.1MB. Free memory was 233.1MB in the beginning and 227.6MB in the end (delta: 5.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-10 00:28:23,766 INFO L158 Benchmark]: BuchiAutomizer took 32402.31ms. Allocated memory was 262.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 227.5MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-02-10 00:28:23,769 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.14ms. Allocated memory is still 162.5MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.69ms. Allocated memory is still 162.5MB. Free memory was 101.2MB in the beginning and 134.1MB in the end (delta: -32.9MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.72ms. Allocated memory was 162.5MB in the beginning and 262.1MB in the end (delta: 99.6MB). Free memory was 134.1MB in the beginning and 233.2MB in the end (delta: -99.1MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * RCFGBuilder took 442.54ms. Allocated memory is still 262.1MB. Free memory was 233.1MB in the beginning and 227.6MB in the end (delta: 5.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 32402.31ms. Allocated memory was 262.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 227.5MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.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. The remainder module has 54117 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 32.2s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 180 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital47 mio100 ax100 hnf100 lsp132 ukn54 mio100 lsp58 div100 bol100 ite100 ukn100 eq160 hnf100 smp100 dnf162 smp57 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 60]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L69] FORK 0 fork 1 computeMin(); [L70] FORK 0 fork 2, 2 computeMin(); [L71] FORK 0 fork 3, 3, 3 computeMax(); [L72] FORK 0 fork 4, 4, 4, 4 computeMax(); [L73] FORK 0 fork 5, 5, 5, 5, 5 sample(); Loop: [L61] min_samples[i1 - 1] := array_min; [L62] max_samples[i2 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 60]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L69] FORK 0 fork 1 computeMin(); [L70] FORK 0 fork 2, 2 computeMin(); [L71] FORK 0 fork 3, 3, 3 computeMax(); [L72] FORK 0 fork 4, 4, 4, 4 computeMax(); [L73] FORK 0 fork 5, 5, 5, 5, 5 sample(); Loop: [L61] min_samples[i1 - 1] := array_min; [L62] max_samples[i2 - 1] := array_max; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 00:28:23,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...