/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:57,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:57,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:57,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:57,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:57,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:57,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:57,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:57,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:57,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:57,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:57,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:57,902 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:57,902 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:57,902 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:57,903 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:57,903 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:57,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:57,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:57,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:57,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:57,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:57,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:57,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:57,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:57,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:57,905 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:57,905 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:57,905 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:58,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:58,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:58,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:58,125 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:58,125 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:58,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl [2025-04-26 16:53:58,127 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl' [2025-04-26 16:53:58,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:58,144 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:58,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:58,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:58,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:58,152 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 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,174 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 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,179 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:58,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:58,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:58,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:58,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:58,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:58,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:58,209 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:58,209 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:58,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:58,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:53:58,260 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2025-04-26 16:53:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2025-04-26 16:53:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2025-04-26 16:53:58,260 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:58,260 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 16:53:58,261 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 16:53:58,261 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 16:53:58,261 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2025-04-26 16:53:58,261 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2025-04-26 16:53:58,261 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2025-04-26 16:53:58,262 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:53:58,300 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:58,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:58,379 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:58,379 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:58,391 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:58,391 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 16:53:58,391 INFO L201 PluginConnector]: Adding new model min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:58 BoogieIcfgContainer [2025-04-26 16:53:58,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:58,392 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:58,392 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:58,396 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:58,396 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:58,397 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/2) ... [2025-04-26 16:53:58,397 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d142404 and model type min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:58, skipping insertion in model container [2025-04-26 16:53:58,398 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:58,398 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:58" (2/2) ... [2025-04-26 16:53:58,398 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-sample.bpl [2025-04-26 16:53:58,439 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:53:58,486 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:58,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:58,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:53:58,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 76 flow [2025-04-26 16:53:58,576 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-26 16:53:58,581 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:53:58,584 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. [2025-04-26 16:53:58,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 76 flow [2025-04-26 16:53:58,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 61 flow [2025-04-26 16:53:58,587 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 23 transitions, 61 flow [2025-04-26 16:53:58,595 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:58,760 WARN L140 AmpleReduction]: Number of pruned transitions: 129 [2025-04-26 16:53:58,760 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:58,760 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 16:53:58,761 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:41 [2025-04-26 16:53:58,761 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:86 [2025-04-26 16:53:58,761 WARN L145 AmpleReduction]: Times succ was already a loop node:67 [2025-04-26 16:53:58,761 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:2 [2025-04-26 16:53:58,761 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:58,764 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 167 states, 165 states have (on average 2.0424242424242425) internal successors, (in total 337), 166 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:58,769 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:58,769 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:58,770 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:58,770 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:58,770 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:58,770 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:58,770 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:58,770 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:58,772 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 167 states, 165 states have (on average 2.0424242424242425) internal successors, (in total 337), 166 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:58,787 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 112 [2025-04-26 16:53:58,787 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:58,787 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:58,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:58,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:58,791 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:58,791 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 167 states, 165 states have (on average 2.0424242424242425) internal successors, (in total 337), 166 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:58,795 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 112 [2025-04-26 16:53:58,795 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:58,795 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:58,795 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:58,795 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:58,799 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0]" "[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]" "[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]" [2025-04-26 16:53:58,800 INFO L754 eck$LassoCheckResult]: Loop: "[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]" "[69] L61-->L59: Formula: (= (store v_max_samples_2 (+ (- 1) v_i2_7) v_array_max_6) v_max_samples_1) InVars {array_max=v_array_max_6, i2=v_i2_7, max_samples=v_max_samples_2} OutVars{array_max=v_array_max_6, i2=v_i2_7, max_samples=v_max_samples_1} AuxVars[] AssignedVars[max_samples]" [2025-04-26 16:53:58,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash 107344, now seen corresponding path program 1 times [2025-04-26 16:53:58,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:58,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706261398] [2025-04-26 16:53:58,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:58,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:58,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:58,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:58,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:58,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:58,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:58,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:58,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash 3138, now seen corresponding path program 1 times [2025-04-26 16:53:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:58,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308260357] [2025-04-26 16:53:58,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:58,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:58,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:58,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:58,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:58,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:58,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:58,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:58,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash 103159761, now seen corresponding path program 1 times [2025-04-26 16:53:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:58,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906743640] [2025-04-26 16:53:58,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:58,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:58,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:58,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:58,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:58,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:58,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:59,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:59,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:59,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:59,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:59,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:59,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:53:59,103 INFO L201 PluginConnector]: Adding new model min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:53:59 BoogieIcfgContainer [2025-04-26 16:53:59,103 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:53:59,105 INFO L158 Benchmark]: Toolchain (without parser) took 959.74ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 94.7MB in the beginning and 290.2MB in the end (delta: -195.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:59,105 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:59,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.29ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 92.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:59,106 INFO L158 Benchmark]: Boogie Preprocessor took 26.52ms. Allocated memory is still 167.8MB. Free memory was 92.8MB in the beginning and 91.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:53:59,106 INFO L158 Benchmark]: RCFGBuilder took 182.82ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 82.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:53:59,109 INFO L158 Benchmark]: BuchiAutomizer took 711.37ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 82.0MB in the beginning and 290.2MB in the end (delta: -208.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:59,110 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.19ms. Allocated memory is still 167.8MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.29ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 92.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.52ms. Allocated memory is still 167.8MB. Free memory was 92.8MB in the beginning and 91.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 182.82ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 82.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 711.37ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 82.0MB in the beginning and 290.2MB in the end (delta: -208.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.6s and 1 iterations. TraceHistogramMax:1. Analysis of lassos took 0.2s. 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.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 281, Number of transitions in reduction automaton: 337, Number of states in reduction automaton: 167, Underlying: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - 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(); 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(); 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! [2025-04-26 16:53:59,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...