/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_AUTOMATON -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-09 23:24:48,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:24:49,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:24:49,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:24:49,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:24:49,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:24:49,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:24:49,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:24:49,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:24:49,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:24:49,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:24:49,083 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:24:49,083 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:24:49,084 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:24:49,085 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:24:49,085 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:24:49,085 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:24:49,085 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:24:49,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:24:49,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:24:49,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:24:49,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:24:49,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:24:49,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:24:49,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:24:49,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:24:49,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:24:49,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:24:49,088 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:24:49,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:24:49,089 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:24:49,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:24:49,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:24:49,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:24:49,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:24:49,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:24:49,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:24:49,090 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:24:49,090 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_AUTOMATON [2024-02-09 23:24:49,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:24:49,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:24:49,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:24:49,372 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:24:49,373 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:24:49,374 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-09 23:24:49,374 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl' [2024-02-09 23:24:49,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:24:49,396 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:24:49,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:24:49,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:24:49,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:24:49,417 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 09.02 11:24:49" (1/1) ... [2024-02-09 23:24:49,424 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 09.02 11:24:49" (1/1) ... [2024-02-09 23:24:49,430 INFO L138 Inliner]: procedures = 4, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:24:49,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:24:49,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:24:49,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:24:49,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:24:49,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:49" (1/1) ... [2024-02-09 23:24:49,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:49" (1/1) ... [2024-02-09 23:24:49,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:49" (1/1) ... [2024-02-09 23:24:49,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:49" (1/1) ... [2024-02-09 23:24:49,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:49" (1/1) ... [2024-02-09 23:24:49,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:49" (1/1) ... [2024-02-09 23:24:49,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:49" (1/1) ... [2024-02-09 23:24:49,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:49" (1/1) ... [2024-02-09 23:24:49,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:24:49,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:24:49,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:24:49,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:24:49,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:49" (1/1) ... [2024-02-09 23:24:49,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:49,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:49,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:49,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-09 23:24:49,598 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-09 23:24:49,598 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-09 23:24:49,598 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-09 23:24:49,598 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:24:49,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:24:49,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:24:49,598 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-09 23:24:49,599 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-09 23:24:49,599 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-09 23:24:49,599 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-09 23:24:49,599 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-09 23:24:49,599 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-09 23:24:49,599 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:24:49,638 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:24:49,640 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:24:49,721 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:24:49,735 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:24:49,735 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-09 23:24:49,737 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:24:49 BoogieIcfgContainer [2024-02-09 23:24:49,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:24:49,738 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:24:49,738 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:24:49,755 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:24:49,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:24:49,756 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:49" (1/2) ... [2024-02-09 23:24:49,759 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5402ac42 and model type min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:24:49, skipping insertion in model container [2024-02-09 23:24:49,759 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:24:49,759 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:24:49" (2/2) ... [2024-02-09 23:24:49,761 INFO L332 chiAutomizerObserver]: Analyzing ICFG min2-max2-sample.bpl [2024-02-09 23:24:49,827 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-09 23:24:49,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 130 flow [2024-02-09 23:24:49,868 INFO L124 PetriNetUnfolderBase]: 5/39 cut-off events. [2024-02-09 23:24:49,868 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-09 23:24:49,873 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-09 23:24:49,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 130 flow [2024-02-09 23:24:49,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 105 flow [2024-02-09 23:24:49,886 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:24:49,886 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:24:49,886 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:24:49,886 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:24:49,886 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:24:49,886 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:24:49,886 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:24:49,887 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-02-09 23:24:49,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2024-02-09 23:24:50,487 INFO L131 ngComponentsAnalysis]: Automaton has 1664 accepting balls. 5544 [2024-02-09 23:24:50,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:50,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:50,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-02-09 23:24:50,492 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:24:50,493 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:24:50,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 6228 states, but on-demand construction may add more states [2024-02-09 23:24:50,599 INFO L131 ngComponentsAnalysis]: Automaton has 1664 accepting balls. 5544 [2024-02-09 23:24:50,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:50,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:50,603 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-02-09 23:24:50,603 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:24:50,614 INFO L748 eck$LassoCheckResult]: Stem: 58#[$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] 61#[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] 63#[L69, L33]don't care [85] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1] 69#[L69, L36-1]don't care [2024-02-09 23:24:50,616 INFO L750 eck$LassoCheckResult]: Loop: 69#[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[] 83#[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] 69#[L69, L36-1]don't care [2024-02-09 23:24:50,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash 126658, now seen corresponding path program 1 times [2024-02-09 23:24:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:50,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075070483] [2024-02-09 23:24:50,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:50,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:50,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2024-02-09 23:24:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:50,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095370434] [2024-02-09 23:24:50,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:50,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash 121721124, now seen corresponding path program 1 times [2024-02-09 23:24:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:50,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493096165] [2024-02-09 23:24:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:50,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:50,951 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:50,951 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:50,951 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:50,951 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:50,951 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:50,951 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:50,952 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:50,952 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:50,952 INFO L133 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:24:50,952 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:50,952 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:50,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:50,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:50,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:51,134 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:51,137 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:51,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:51,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:51,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:51,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:51,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:51,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:51,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:51,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:51,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:51,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:51,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-09 23:24:51,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:51,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:51,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:51,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:51,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:51,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-09 23:24:51,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:51,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:51,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:24:51,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:51,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:51,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:51,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:24:51,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:24:51,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:51,223 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-09 23:24:51,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:51,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:51,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:51,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:51,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:51,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:51,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:51,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:51,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:51,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:51,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-09 23:24:51,259 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:51,265 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:24:51,265 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:24:51,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:51,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:51,286 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:51,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-09 23:24:51,289 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:51,310 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:51,311 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:51,311 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2024-02-09 23:24:51,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:51,319 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:51,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:51,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:51,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:51,369 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:51,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:24:51,421 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-09 23:24:51,429 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 6228 states, but on-demand construction may add more states Second 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-09 23:24:51,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:52,119 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 6228 states, but on-demand construction may add more states. Second 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 24650 states and 133431 transitions. Complement of second has 8 states. [2024-02-09 23:24:52,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:24:52,125 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-09 23:24:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-02-09 23:24:52,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 3 letters. Loop has 2 letters. [2024-02-09 23:24:52,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:52,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-09 23:24:52,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:52,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 3 letters. Loop has 4 letters. [2024-02-09 23:24:52,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:52,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24650 states and 133431 transitions. [2024-02-09 23:24:52,971 INFO L131 ngComponentsAnalysis]: Automaton has 2859 accepting balls. 8476 [2024-02-09 23:24:53,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24650 states to 20100 states and 110108 transitions. [2024-02-09 23:24:53,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10941 [2024-02-09 23:24:53,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15103 [2024-02-09 23:24:53,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20100 states and 110108 transitions. [2024-02-09 23:24:53,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:24:53,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20100 states and 110108 transitions. [2024-02-09 23:24:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20100 states and 110108 transitions. [2024-02-09 23:24:54,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20100 to 15022. [2024-02-09 23:24:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15022 states, 15022 states have (on average 5.750432698708561) internal successors, (86383), 15021 states have internal predecessors, (86383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15022 states to 15022 states and 86383 transitions. [2024-02-09 23:24:54,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15022 states and 86383 transitions. [2024-02-09 23:24:54,500 INFO L428 stractBuchiCegarLoop]: Abstraction has 15022 states and 86383 transitions. [2024-02-09 23:24:54,500 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:24:54,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15022 states and 86383 transitions. [2024-02-09 23:24:54,608 INFO L131 ngComponentsAnalysis]: Automaton has 2571 accepting balls. 7722 [2024-02-09 23:24:54,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:54,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:54,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-02-09 23:24:54,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:24:54,610 INFO L748 eck$LassoCheckResult]: Stem: 57720#[$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] 57722#[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] 58370#[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] 56536#[L70, L33, $Ultimate##0]don't care [91] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1] 56542#[L70, $Ultimate##0, L36-1]don't care [2024-02-09 23:24:54,610 INFO L750 eck$LassoCheckResult]: Loop: 56542#[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[] 57510#[L70, $Ultimate##0, L36]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] 56542#[L70, $Ultimate##0, L36-1]don't care [2024-02-09 23:24:54,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:54,611 INFO L85 PathProgramCache]: Analyzing trace with hash 3942981, now seen corresponding path program 1 times [2024-02-09 23:24:54,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:54,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438864474] [2024-02-09 23:24:54,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:54,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:54,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:54,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2024-02-09 23:24:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991176396] [2024-02-09 23:24:54,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:54,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:54,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:54,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:54,625 INFO L85 PathProgramCache]: Analyzing trace with hash -505759577, now seen corresponding path program 1 times [2024-02-09 23:24:54,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:54,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939245709] [2024-02-09 23:24:54,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:54,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:54,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:54,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:54,680 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:54,680 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:54,680 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:54,680 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:54,680 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:54,680 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:54,680 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:54,680 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:54,680 INFO L133 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:24:54,680 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:54,680 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:54,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:54,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:54,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:54,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:54,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:54,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:54,896 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:54,897 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:54,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:54,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:54,898 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:54,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:54,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:54,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:54,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:54,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:54,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:54,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:54,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-09 23:24:54,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:54,940 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-09 23:24:54,940 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:24:54,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:54,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:54,957 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:54,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-09 23:24:54,961 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:54,988 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:54,989 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:54,989 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2024-02-09 23:24:55,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-02-09 23:24:55,005 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:55,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:55,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:55,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:55,029 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:55,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:24:55,040 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-09 23:24:55,040 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15022 states and 86383 transitions. cyclomatic complexity: 74736 Second 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-09 23:24:55,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-09 23:24:55,636 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15022 states and 86383 transitions. cyclomatic complexity: 74736. Second 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 31151 states and 178931 transitions. Complement of second has 8 states. [2024-02-09 23:24:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:24:55,637 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-09 23:24:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-02-09 23:24:55,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 4 letters. Loop has 2 letters. [2024-02-09 23:24:55,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:55,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 6 letters. Loop has 2 letters. [2024-02-09 23:24:55,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:55,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 4 letters. Loop has 4 letters. [2024-02-09 23:24:55,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:55,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31151 states and 178931 transitions. [2024-02-09 23:24:56,507 INFO L131 ngComponentsAnalysis]: Automaton has 3312 accepting balls. 8628 [2024-02-09 23:24:57,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31151 states to 26847 states and 156510 transitions. [2024-02-09 23:24:57,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12773 [2024-02-09 23:24:57,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16757 [2024-02-09 23:24:57,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26847 states and 156510 transitions. [2024-02-09 23:24:57,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:24:57,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26847 states and 156510 transitions. [2024-02-09 23:24:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26847 states and 156510 transitions. [2024-02-09 23:24:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26847 to 14609. [2024-02-09 23:24:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14609 states, 14609 states have (on average 6.11171195838182) internal successors, (89286), 14608 states have internal predecessors, (89286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14609 states to 14609 states and 89286 transitions. [2024-02-09 23:24:57,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14609 states and 89286 transitions. [2024-02-09 23:24:57,893 INFO L428 stractBuchiCegarLoop]: Abstraction has 14609 states and 89286 transitions. [2024-02-09 23:24:57,893 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:24:57,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14609 states and 89286 transitions. [2024-02-09 23:24:58,027 INFO L131 ngComponentsAnalysis]: Automaton has 2130 accepting balls. 5546 [2024-02-09 23:24:58,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:58,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:58,028 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-02-09 23:24:58,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:24:58,042 INFO L748 eck$LassoCheckResult]: Stem: 102109#[$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] 102111#[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] 110993#[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] 110997#[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] 121821#[$Ultimate##0, $Ultimate##0, L72, $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] 116903#[$Ultimate##0, L73, $Ultimate##0, L60, $Ultimate##0, $Ultimate##0]don't care [2024-02-09 23:24:58,043 INFO L750 eck$LassoCheckResult]: Loop: 116903#[$Ultimate##0, L73, $Ultimate##0, L60, $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] 116901#[$Ultimate##0, L62, L73, $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] 116903#[$Ultimate##0, L73, $Ultimate##0, L60, $Ultimate##0, $Ultimate##0]don't care [2024-02-09 23:24:58,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash 122246471, now seen corresponding path program 1 times [2024-02-09 23:24:58,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:58,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744729232] [2024-02-09 23:24:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:58,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:58,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash 3586, now seen corresponding path program 1 times [2024-02-09 23:24:58,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:58,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886266847] [2024-02-09 23:24:58,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:58,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:58,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1514744264, now seen corresponding path program 1 times [2024-02-09 23:24:58,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:58,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287113724] [2024-02-09 23:24:58,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:58,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,238 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:24:58 BoogieIcfgContainer [2024-02-09 23:24:58,238 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:24:58,239 INFO L158 Benchmark]: Toolchain (without parser) took 8841.95ms. Allocated memory was 173.0MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 118.4MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 719.9MB. Max. memory is 8.0GB. [2024-02-09 23:24:58,239 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 173.0MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:24:58,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.00ms. Allocated memory is still 173.0MB. Free memory was 118.4MB in the beginning and 116.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:24:58,240 INFO L158 Benchmark]: Boogie Preprocessor took 89.37ms. Allocated memory is still 173.0MB. Free memory was 116.7MB in the beginning and 152.7MB in the end (delta: -36.0MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2024-02-09 23:24:58,253 INFO L158 Benchmark]: RCFGBuilder took 214.72ms. Allocated memory is still 173.0MB. Free memory was 152.6MB in the beginning and 142.7MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-09 23:24:58,254 INFO L158 Benchmark]: BuchiAutomizer took 8500.32ms. Allocated memory was 173.0MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 142.6MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 743.4MB. Max. memory is 8.0GB. [2024-02-09 23:24:58,255 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.11ms. Allocated memory is still 173.0MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.00ms. Allocated memory is still 173.0MB. Free memory was 118.4MB in the beginning and 116.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 89.37ms. Allocated memory is still 173.0MB. Free memory was 116.7MB in the beginning and 152.7MB in the end (delta: -36.0MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * RCFGBuilder took 214.72ms. Allocated memory is still 173.0MB. Free memory was 152.6MB in the beginning and 142.7MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 8500.32ms. Allocated memory was 173.0MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 142.6MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 743.4MB. 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 14609 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 1.6s AutomataMinimizationTime, 2 MinimizatonAttempts, 17316 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 2.8s Buchi closure took 0.1s. 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, 167 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 94 mSDtfsCounter, 199 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: 47ms 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-09 23:24:58,476 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 Received shutdown request...