/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 -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:53:41,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:53:41,868 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:53:41,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:53:41,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:53:41,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:53:41,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:53:41,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:53:41,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:53:41,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:53:41,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:53:41,887 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:53:41,891 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:53:41,891 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:53:41,891 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:53:41,891 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:53:41,892 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:53:41,892 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:53:41,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:53:41,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:53:41,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:53:41,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:53:41,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:53:41,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:53:41,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:53:41,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:53:41,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:53:41,896 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:53:41,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:53:41,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:53:41,897 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:53:41,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:53:41,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:53:41,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:53:41,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:53:41,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:53:41,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:53:41,898 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:53:41,899 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 [2024-02-09 23:53:42,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:53:42,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:53:42,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:53:42,192 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:53:42,196 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:53:42,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl [2024-02-09 23:53:42,197 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl' [2024-02-09 23:53:42,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:53:42,218 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:53:42,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:53:42,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:53:42,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:53:42,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/1) ... [2024-02-09 23:53:42,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/1) ... [2024-02-09 23:53:42,256 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:53:42,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:53:42,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:53:42,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:53:42,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:53:42,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/1) ... [2024-02-09 23:53:42,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/1) ... [2024-02-09 23:53:42,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/1) ... [2024-02-09 23:53:42,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/1) ... [2024-02-09 23:53:42,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/1) ... [2024-02-09 23:53:42,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/1) ... [2024-02-09 23:53:42,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/1) ... [2024-02-09 23:53:42,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/1) ... [2024-02-09 23:53:42,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:53:42,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:53:42,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:53:42,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:53:42,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/1) ... [2024-02-09 23:53:42,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:42,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:42,325 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:53:42,370 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:53:42,391 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-09 23:53:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-09 23:53:42,391 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-09 23:53:42,391 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:53:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:53:42,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:53:42,392 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-09 23:53:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-09 23:53:42,392 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-09 23:53:42,392 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-09 23:53:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-09 23:53:42,392 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-09 23:53:42,393 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:53:42,433 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:53:42,434 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:53:42,540 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:53:42,551 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:53:42,551 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-09 23:53:42,553 INFO L201 PluginConnector]: Adding new model min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:53:42 BoogieIcfgContainer [2024-02-09 23:53:42,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:53:42,553 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:53:42,554 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:53:42,560 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:53:42,561 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:53:42,561 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:42" (1/2) ... [2024-02-09 23:53:42,563 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@303f02e2 and model type min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:53:42, skipping insertion in model container [2024-02-09 23:53:42,563 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:53:42,563 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:53:42" (2/2) ... [2024-02-09 23:53:42,564 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample.bpl [2024-02-09 23:53:42,618 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-09 23:53:42,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 76 flow [2024-02-09 23:53:42,661 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2024-02-09 23:53:42,661 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:53:42,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 23 events. 3/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 39 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-02-09 23:53:42,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 76 flow [2024-02-09 23:53:42,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 61 flow [2024-02-09 23:53:42,674 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:53:42,674 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:53:42,675 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:53:42,675 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:53:42,675 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:53:42,675 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:53:42,675 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:53:42,675 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:53:42,676 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 places, 23 transitions, 61 flow [2024-02-09 23:53:42,680 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:42,680 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-09 23:53:42,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-09 23:53:42,680 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:42,683 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:53:42,683 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 places, 23 transitions, 61 flow [2024-02-09 23:53:42,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:42,685 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-09 23:53:42,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-09 23:53:42,686 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:42,689 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [78] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 39#[$Ultimate##0, L68]true [70] $Ultimate##0-->L32: Formula: (= v_array_min_4 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_min=v_array_min_4} AuxVars[] AssignedVars[array_min] 41#[L32, L68]true [71] L32-->L35-1: Formula: (= v_i1_5 0) InVars {} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1] 43#[L68, L35-1]true [2024-02-09 23:53:42,690 INFO L750 eck$LassoCheckResult]: Loop: 43#[L68, L35-1]true [73] L35-1-->L35: Formula: (< v_i1_6 v_N_4) InVars {i1=v_i1_6, N=v_N_4} OutVars{i1=v_i1_6, N=v_N_4} AuxVars[] AssignedVars[] 46#[L35, L68]true [75] L35-->L35-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= (let ((.cse0 (select v_A_7 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0)) v_array_min_7)) InVars {A=v_A_7, i1=v_i1_9, array_min=v_array_min_8} OutVars{A=v_A_7, i1=v_i1_8, array_min=v_array_min_7} AuxVars[] AssignedVars[array_min, i1] 43#[L68, L35-1]true [2024-02-09 23:53:42,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash 106990, now seen corresponding path program 1 times [2024-02-09 23:53:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218012069] [2024-02-09 23:53:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:42,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:42,776 INFO L85 PathProgramCache]: Analyzing trace with hash 3299, now seen corresponding path program 1 times [2024-02-09 23:53:42,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:42,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922822559] [2024-02-09 23:53:42,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:42,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:42,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:42,797 INFO L85 PathProgramCache]: Analyzing trace with hash 102819728, now seen corresponding path program 1 times [2024-02-09 23:53:42,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:42,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747977376] [2024-02-09 23:53:42,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:42,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:42,933 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:53:42,933 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:53:42,933 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:53:42,933 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:53:42,934 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:53:42,934 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:42,934 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:53:42,934 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:53:42,934 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:53:42,934 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:53:42,934 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:53:42,947 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:53:42,954 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:53:43,106 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:53:43,109 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:53:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:43,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:43,112 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:53:43,124 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:53:43,131 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:53:43,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:43,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:43,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:43,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:43,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:43,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:43,172 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:43,176 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:53:43,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:43,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:43,180 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:53:43,184 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:53:43,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:43,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:43,193 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:53:43,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:43,210 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-09 23:53:43,210 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:53:43,216 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:53:43,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:43,243 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:53:43,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:43,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:43,245 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:53:43,249 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:53:43,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:43,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:43,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:43,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:43,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:43,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:43,265 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:53:43,272 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:53:43,278 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:53:43,278 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:53:43,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:43,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:43,316 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:53:43,320 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:53:43,320 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:53:43,332 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:53:43,332 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:53:43,333 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2024-02-09 23:53:43,336 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:53:43,339 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:53:43,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:43,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:53:43,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:43,394 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:53:43,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:43,413 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:53:43,455 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:53:43,458 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-09 23:53:43,593 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 366 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:53:43,594 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:53:43,594 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:53:43,599 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:53:43,599 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:53:43,601 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:53:43,605 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:53:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-02-09 23:53:43,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 142 transitions. Stem has 3 letters. Loop has 2 letters. [2024-02-09 23:53:43,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:43,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 142 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-09 23:53:43,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:43,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 142 transitions. Stem has 3 letters. Loop has 4 letters. [2024-02-09 23:53:43,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:43,610 INFO L428 stractBuchiCegarLoop]: Abstraction has has 48 places, 576 transitions, 2694 flow [2024-02-09 23:53:43,610 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:53:43,610 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 places, 576 transitions, 2694 flow [2024-02-09 23:53:43,640 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:43,640 INFO L124 PetriNetUnfolderBase]: 76/116 cut-off events. [2024-02-09 23:53:43,640 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-02-09 23:53:43,641 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:43,641 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [78] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 39#[$Ultimate##0, L68]true [81] L68-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 107#[$Ultimate##0, $Ultimate##0, L69]true [84] L69-->L59: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_thidvar1] 109#[$Ultimate##0, $Ultimate##0, L59, L70]true [68] L59-->L61: 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] 111#[$Ultimate##0, $Ultimate##0, L61, L70]true [69] L61-->L59: 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] 109#[$Ultimate##0, $Ultimate##0, L59, L70]true [2024-02-09 23:53:43,644 INFO L750 eck$LassoCheckResult]: Loop: 109#[$Ultimate##0, $Ultimate##0, L59, L70]true [68] L59-->L61: 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] 111#[$Ultimate##0, $Ultimate##0, L61, L70]true [69] L61-->L59: 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] 109#[$Ultimate##0, $Ultimate##0, L59, L70]true [2024-02-09 23:53:43,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:43,645 INFO L85 PathProgramCache]: Analyzing trace with hash 103159761, now seen corresponding path program 1 times [2024-02-09 23:53:43,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:43,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952938845] [2024-02-09 23:53:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:43,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:43,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:43,657 INFO L85 PathProgramCache]: Analyzing trace with hash 3138, now seen corresponding path program 1 times [2024-02-09 23:53:43,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:43,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124585360] [2024-02-09 23:53:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:43,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:43,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:43,683 INFO L85 PathProgramCache]: Analyzing trace with hash 352284690, now seen corresponding path program 2 times [2024-02-09 23:53:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:43,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673982215] [2024-02-09 23:53:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,816 INFO L201 PluginConnector]: Adding new model min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:53:43 BoogieIcfgContainer [2024-02-09 23:53:43,816 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:53:43,818 INFO L158 Benchmark]: Toolchain (without parser) took 1598.45ms. Allocated memory was 151.0MB in the beginning and 243.3MB in the end (delta: 92.3MB). Free memory was 118.6MB in the beginning and 130.3MB in the end (delta: -11.7MB). Peak memory consumption was 80.6MB. Max. memory is 8.0GB. [2024-02-09 23:53:43,819 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 151.0MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:53:43,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.39ms. Allocated memory is still 151.0MB. Free memory was 118.6MB in the beginning and 116.9MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-09 23:53:43,824 INFO L158 Benchmark]: Boogie Preprocessor took 25.49ms. Allocated memory was 151.0MB in the beginning and 243.3MB in the end (delta: 92.3MB). Free memory was 116.9MB in the beginning and 216.8MB in the end (delta: -99.9MB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. [2024-02-09 23:53:43,824 INFO L158 Benchmark]: RCFGBuilder took 267.39ms. Allocated memory is still 243.3MB. Free memory was 216.8MB in the beginning and 206.8MB in the end (delta: 10.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-09 23:53:43,825 INFO L158 Benchmark]: BuchiAutomizer took 1262.90ms. Allocated memory is still 243.3MB. Free memory was 206.8MB in the beginning and 130.3MB in the end (delta: 76.5MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2024-02-09 23:53:43,828 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 151.0MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.39ms. Allocated memory is still 151.0MB. Free memory was 118.6MB in the beginning and 116.9MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.49ms. Allocated memory was 151.0MB in the beginning and 243.3MB in the end (delta: 92.3MB). Free memory was 116.9MB in the beginning and 216.8MB in the end (delta: -99.9MB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. * RCFGBuilder took 267.39ms. Allocated memory is still 243.3MB. Free memory was 216.8MB in the beginning and 206.8MB in the end (delta: 10.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 1262.90ms. Allocated memory is still 243.3MB. Free memory was 206.8MB in the beginning and 130.3MB in the end (delta: 76.5MB). Peak memory consumption was 76.5MB. 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. The remainder module has 2694 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 2 iterations. TraceHistogramMax:0. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 56 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital46 mio100 ax100 hnf100 lsp139 ukn57 mio100 lsp64 div100 bol100 ite100 ukn100 eq166 hnf94 smp100 dnf152 smp62 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 59]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L68] FORK 0 fork 1 computeMin(); [L69] FORK 0 fork 2, 2 computeMax(); [L70] FORK 0 fork 3, 3, 3 sample(); [L60] 3 min_samples[i1 - 1] := array_min; VAL [array_min=7, i1=13456] [L61] 3 max_samples[i2 - 1] := array_max; VAL [array_max=4, array_min=7, i1=13456, i2=0] Loop: [L60] min_samples[i1 - 1] := array_min; [L61] max_samples[i2 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 59]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L68] FORK 0 fork 1 computeMin(); [L69] FORK 0 fork 2, 2 computeMax(); [L70] FORK 0 fork 3, 3, 3 sample(); [L60] 3 min_samples[i1 - 1] := array_min; VAL [array_min=7, i1=13456] [L61] 3 max_samples[i2 - 1] := array_max; VAL [array_max=4, array_min=7, i1=13456, i2=0] Loop: [L60] min_samples[i1 - 1] := array_min; [L61] max_samples[i2 - 1] := array_max; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-09 23:53:43,850 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:53:44,057 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...