/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:00:59,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:00:59,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:00:59,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:00:59,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:00:59,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:00:59,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:00:59,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:00:59,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:00:59,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:00:59,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:00:59,593 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:00:59,593 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:00:59,594 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:00:59,609 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:00:59,609 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:00:59,609 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:00:59,610 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:00:59,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:00:59,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:00:59,610 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:00:59,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:00:59,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:00:59,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:00:59,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:00:59,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:00:59,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:00:59,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:00:59,612 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:00:59,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:00:59,613 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:00:59,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:00:59,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:00:59,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:00:59,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:00:59,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:00:59,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:00:59,615 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:00:59,615 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 01:00:59,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:00:59,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:00:59,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:00:59,879 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:00:59,880 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:00:59,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-2.bpl [2024-02-10 01:00:59,881 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-2.bpl' [2024-02-10 01:00:59,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:00:59,909 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:00:59,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:00:59,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:00:59,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:00:59,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/1) ... [2024-02-10 01:00:59,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/1) ... [2024-02-10 01:00:59,947 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:00:59,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:00:59,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:00:59,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:00:59,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:00:59,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/1) ... [2024-02-10 01:00:59,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/1) ... [2024-02-10 01:00:59,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/1) ... [2024-02-10 01:00:59,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/1) ... [2024-02-10 01:00:59,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/1) ... [2024-02-10 01:00:59,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/1) ... [2024-02-10 01:00:59,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/1) ... [2024-02-10 01:00:59,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/1) ... [2024-02-10 01:00:59,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:01:00,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:01:00,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:01:00,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:01:00,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/1) ... [2024-02-10 01:01:00,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:00,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:00,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:01:00,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 01:01:00,101 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-10 01:01:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-10 01:01:00,102 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-10 01:01:00,102 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:01:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:01:00,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:01:00,102 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 01:01:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 01:01:00,102 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 01:01:00,103 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-10 01:01:00,103 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-10 01:01:00,103 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-10 01:01:00,104 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:01:00,157 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:01:00,158 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:01:00,248 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:01:00,253 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:01:00,254 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-10 01:01:00,255 INFO L201 PluginConnector]: Adding new model min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:01:00 BoogieIcfgContainer [2024-02-10 01:01:00,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:01:00,256 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:01:00,256 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:01:00,261 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:01:00,262 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:01:00,262 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:59" (1/2) ... [2024-02-10 01:01:00,263 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bdbf2c8 and model type min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:01:00, skipping insertion in model container [2024-02-10 01:01:00,263 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:01:00,263 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:01:00" (2/2) ... [2024-02-10 01:01:00,266 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-2.bpl [2024-02-10 01:01:00,328 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:01:00,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 82 flow [2024-02-10 01:01:00,366 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2024-02-10 01:01:00,367 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:01:00,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-02-10 01:01:00,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 82 flow [2024-02-10 01:01:00,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 67 flow [2024-02-10 01:01:00,384 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:01:00,384 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:01:00,384 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:01:00,384 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:01:00,384 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:01:00,384 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:01:00,385 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:01:00,385 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:01:00,385 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 26 transitions, 67 flow [2024-02-10 01:01:00,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:01:00,391 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-10 01:01:00,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 01:01:00,392 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:01:00,394 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:01:00,395 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 26 transitions, 67 flow [2024-02-10 01:01:00,398 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:01:00,398 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-10 01:01:00,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 01:01:00,398 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:01:00,403 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [56] $Ultimate##0-->L70: Formula: (and (<= 0 v_ULTIMATE.start_m_3) (< v_ULTIMATE.start_m_3 v_N_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} AuxVars[] AssignedVars[] 42#[L70]true [82] L70-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 44#[L70-1, $Ultimate##0]true [85] L70-1-->$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] 46#[$Ultimate##0, $Ultimate##0, L71]true [88] L71-->L57: 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] 48#[$Ultimate##0, L57, $Ultimate##0, L72]true [2024-02-10 01:01:00,404 INFO L750 eck$LassoCheckResult]: Loop: 48#[$Ultimate##0, L57, $Ultimate##0, L72]true [71] L57-->L59: 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] 51#[$Ultimate##0, $Ultimate##0, L59, L72]true [72] L59-->L57: 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] 48#[$Ultimate##0, L57, $Ultimate##0, L72]true [2024-02-10 01:01:00,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:00,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2673342, now seen corresponding path program 1 times [2024-02-10 01:01:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:00,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609984129] [2024-02-10 01:01:00,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:00,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:00,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:00,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:00,506 INFO L85 PathProgramCache]: Analyzing trace with hash 3234, now seen corresponding path program 1 times [2024-02-10 01:01:00,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:00,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131386010] [2024-02-10 01:01:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:00,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:00,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:00,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:00,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1725883361, now seen corresponding path program 1 times [2024-02-10 01:01:00,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:00,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720443767] [2024-02-10 01:01:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:00,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:00,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:00,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:00,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:00,745 INFO L201 PluginConnector]: Adding new model min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:01:00 BoogieIcfgContainer [2024-02-10 01:01:00,746 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:01:00,747 INFO L158 Benchmark]: Toolchain (without parser) took 837.78ms. Allocated memory is still 160.4MB. Free memory was 127.1MB in the beginning and 101.5MB in the end (delta: 25.5MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2024-02-10 01:01:00,748 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 160.4MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:01:00,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.30ms. Allocated memory is still 160.4MB. Free memory was 126.9MB in the beginning and 137.0MB in the end (delta: -10.1MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2024-02-10 01:01:00,750 INFO L158 Benchmark]: Boogie Preprocessor took 38.80ms. Allocated memory is still 160.4MB. Free memory was 137.0MB in the beginning and 137.6MB in the end (delta: -618.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:01:00,750 INFO L158 Benchmark]: RCFGBuilder took 255.55ms. Allocated memory is still 160.4MB. Free memory was 137.6MB in the beginning and 127.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 01:01:00,751 INFO L158 Benchmark]: BuchiAutomizer took 489.69ms. Allocated memory is still 160.4MB. Free memory was 127.5MB in the beginning and 101.5MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2024-02-10 01:01:00,752 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 160.4MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.30ms. Allocated memory is still 160.4MB. Free memory was 126.9MB in the beginning and 137.0MB in the end (delta: -10.1MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.80ms. Allocated memory is still 160.4MB. Free memory was 137.0MB in the beginning and 137.6MB in the end (delta: -618.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.55ms. Allocated memory is still 160.4MB. Free memory was 137.6MB in the beginning and 127.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 489.69ms. Allocated memory is still 160.4MB. Free memory was 127.5MB in the beginning and 101.5MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.3s and 1 iterations. TraceHistogramMax:0. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 57]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L68] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L70] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L71] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L72] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L58] min_samples[i1 - 1] := array_min; [L59] max_samples[i2 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 57]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L68] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L70] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L71] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L72] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L58] min_samples[i1 - 1] := array_min; [L59] max_samples[i2 - 1] := array_max; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 01:01:00,776 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...