/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 18:39:23,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:23,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:23,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:23,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:23,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:23,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:23,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:23,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:23,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:23,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:23,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:23,645 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:23,645 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:23,645 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:23,645 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:23,645 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:23,645 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:23,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:23,646 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:23,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:23,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:23,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:23,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:23,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:23,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:23,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:23,647 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:23,647 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:23,647 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:23,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:23,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:23,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:23,892 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:23,893 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:23,895 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 18:39:23,896 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl' [2025-04-26 18:39:23,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:23,916 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:23,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:23,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:23,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:23,924 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,946 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,955 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:23,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:23,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:23,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:23,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:23,962 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,962 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,964 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,964 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,967 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,968 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,971 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,972 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,973 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:23,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:23,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:23,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:23,987 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 06:39:23" (1/1) ... [2025-04-26 18:39:23,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:23,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:24,011 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 18:39:24,015 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 18:39:24,034 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2025-04-26 18:39:24,034 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2025-04-26 18:39:24,034 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2025-04-26 18:39:24,034 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:24,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:24,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:24,034 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 18:39:24,034 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 18:39:24,034 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 18:39:24,034 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2025-04-26 18:39:24,034 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2025-04-26 18:39:24,034 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2025-04-26 18:39:24,035 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 18:39:24,068 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:24,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:24,135 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:24,135 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:24,148 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:24,149 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 18:39:24,149 INFO L201 PluginConnector]: Adding new model min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:24 BoogieIcfgContainer [2025-04-26 18:39:24,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:24,150 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:24,150 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:24,154 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:24,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:24,154 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 06:39:23" (1/2) ... [2025-04-26 18:39:24,155 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e083f85 and model type min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:24, skipping insertion in model container [2025-04-26 18:39:24,155 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:24,155 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 06:39:24" (2/2) ... [2025-04-26 18:39:24,156 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-sample.bpl [2025-04-26 18:39:24,203 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:24,246 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:24,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:24,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:24,248 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 18:39:24,251 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 18:39:24,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 76 flow [2025-04-26 18:39:24,319 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-26 18:39:24,323 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:24,327 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 18:39:24,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 76 flow [2025-04-26 18:39:24,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 61 flow [2025-04-26 18:39:24,329 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 23 transitions, 61 flow [2025-04-26 18:39:24,331 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 23 transitions, 61 flow [2025-04-26 18:39:24,368 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 181 states, 179 states have (on average 2.921787709497207) internal successors, (in total 523), 180 states have internal predecessors, (523), 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 18:39:24,369 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 181 states, 179 states have (on average 2.921787709497207) internal successors, (in total 523), 180 states have internal predecessors, (523), 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 18:39:24,371 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:24,503 WARN L140 AmpleReduction]: Number of pruned transitions: 129 [2025-04-26 18:39:24,503 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:24,506 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 18:39:24,506 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:41 [2025-04-26 18:39:24,506 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:86 [2025-04-26 18:39:24,506 WARN L145 AmpleReduction]: Times succ was already a loop node:67 [2025-04-26 18:39:24,506 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:2 [2025-04-26 18:39:24,506 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:24,507 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 18:39:24,513 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:24,513 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:24,513 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:24,513 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:24,513 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:24,513 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:24,513 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:24,513 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:24,515 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 18:39:24,533 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 112 [2025-04-26 18:39:24,533 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:24,533 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:24,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:24,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:24,539 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:24,539 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 18:39:24,544 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 112 [2025-04-26 18:39:24,544 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:24,544 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:24,544 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:24,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:24,548 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 18:39:24,548 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 18:39:24,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash 107344, now seen corresponding path program 1 times [2025-04-26 18:39:24,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:24,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016643716] [2025-04-26 18:39:24,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:24,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:24,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:24,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:24,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:24,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:24,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:24,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:24,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:24,646 INFO L85 PathProgramCache]: Analyzing trace with hash 3138, now seen corresponding path program 1 times [2025-04-26 18:39:24,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:24,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484555052] [2025-04-26 18:39:24,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:24,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:24,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:24,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:24,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:24,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:24,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:24,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:24,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash 103159761, now seen corresponding path program 1 times [2025-04-26 18:39:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:24,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894208743] [2025-04-26 18:39:24,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:24,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:24,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:24,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:24,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:24,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:24,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:24,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:24,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:24,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:24,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:24,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:24,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,814 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 18:39:24,820 INFO L201 PluginConnector]: Adding new model min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:24 BoogieIcfgContainer [2025-04-26 18:39:24,820 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:24,821 INFO L158 Benchmark]: Toolchain (without parser) took 904.55ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 97.7MB in the end (delta: -11.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:24,822 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.69ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:24,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.57ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:24,822 INFO L158 Benchmark]: Boogie Preprocessor took 28.41ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 83.1MB in the end (delta: 917.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:24,822 INFO L158 Benchmark]: RCFGBuilder took 163.49ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 73.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:24,824 INFO L158 Benchmark]: BuchiAutomizer took 670.52ms. Allocated memory is still 159.4MB. Free memory was 72.8MB in the beginning and 97.7MB in the end (delta: -24.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:24,826 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.69ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.57ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.41ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 83.1MB in the end (delta: 917.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 163.49ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 73.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 670.52ms. Allocated memory is still 159.4MB. Free memory was 72.8MB in the beginning and 97.7MB in the end (delta: -24.9MB). 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.5s 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]: 265, 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 18:39:24,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...