/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-abs-2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:55,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:55,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:55,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:55,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:55,509 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:55,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:55,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:55,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:55,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:55,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:55,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:55,531 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:55,531 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:55,531 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:55,531 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:55,531 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:55,531 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:55,531 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:55,531 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:55,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:55,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:55,531 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:55,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:55,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:55,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:55,532 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:55,533 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:55,533 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:55,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:55,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:55,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:55,751 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:55,752 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:55,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-2.bpl [2025-04-26 16:53:55,753 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-2.bpl' [2025-04-26 16:53:55,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:55,774 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:55,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:55,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:55,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:55,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,814 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:55,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:55,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:55,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:55,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:55,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,824 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:55,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:55,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:55,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:55,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/1) ... [2025-04-26 16:53:55,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:55,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,863 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:55,869 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:55,891 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2025-04-26 16:53:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2025-04-26 16:53:55,891 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2025-04-26 16:53:55,891 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:55,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:55,891 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 16:53:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 16:53:55,892 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 16:53:55,892 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2025-04-26 16:53:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2025-04-26 16:53:55,892 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2025-04-26 16:53:55,892 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2025-04-26 16:53:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2025-04-26 16:53:55,892 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2025-04-26 16:53:55,893 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:55,931 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:55,933 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:56,024 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:56,024 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:56,037 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:56,037 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 16:53:56,038 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:56 BoogieIcfgContainer [2025-04-26 16:53:56,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:56,039 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:56,039 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:56,044 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:56,044 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:56,045 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:55" (1/2) ... [2025-04-26 16:53:56,049 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@efcf99f and model type min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:56, skipping insertion in model container [2025-04-26 16:53:56,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:56,049 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:56" (2/2) ... [2025-04-26 16:53:56,050 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs-2.bpl [2025-04-26 16:53:56,106 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:53:56,141 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:56,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:56,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,143 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:56,144 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:56,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 116 flow [2025-04-26 16:53:56,233 INFO L116 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-04-26 16:53:56,234 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:53:56,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 4/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-26 16:53:56,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 116 flow [2025-04-26 16:53:56,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 96 flow [2025-04-26 16:53:56,246 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 45 places, 36 transitions, 96 flow [2025-04-26 16:53:56,258 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:56,470 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 362#[L49, L87, L74, computeMinEXIT]true [2025-04-26 16:53:56,589 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1456#[mapAbsEXIT, L49, L72, L88, L35]true [2025-04-26 16:53:56,598 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1244#[L49, L87, L74, L35]true [2025-04-26 16:53:56,635 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2484#[mapAbsEXIT, L49, L72, L88, $Ultimate##0]true [2025-04-26 16:53:56,636 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2476#[L49, L72, L61, L88, $Ultimate##0]true [2025-04-26 16:53:56,646 WARN L140 AmpleReduction]: Number of pruned transitions: 1589 [2025-04-26 16:53:56,647 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 5 [2025-04-26 16:53:56,647 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 149 [2025-04-26 16:53:56,647 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:61 [2025-04-26 16:53:56,647 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:651 [2025-04-26 16:53:56,647 WARN L145 AmpleReduction]: Times succ was already a loop node:105 [2025-04-26 16:53:56,647 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:262 [2025-04-26 16:53:56,648 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:56,654 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 857 states, 855 states have (on average 1.7777777777777777) internal successors, (in total 1520), 856 states have internal predecessors, (1520), 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:56,663 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:56,663 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:56,663 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:56,663 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:56,663 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:56,663 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:56,663 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:56,663 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:56,667 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 857 states, 855 states have (on average 1.7777777777777777) internal successors, (in total 1520), 856 states have internal predecessors, (1520), 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:56,708 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 613 [2025-04-26 16:53:56,710 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:56,710 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:56,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:53:56,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:56,715 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:56,717 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 857 states, 855 states have (on average 1.7777777777777777) internal successors, (in total 1520), 856 states have internal predecessors, (1520), 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:56,728 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 613 [2025-04-26 16:53:56,730 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:56,730 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:56,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:53:56,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:56,735 INFO L752 eck$LassoCheckResult]: Stem: "[82] $Ultimate##0-->L85: 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[]" "[113] L85-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0]" "[116] L85-1-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1]" "[119] L86-->L70: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1]" [2025-04-26 16:53:56,735 INFO L754 eck$LassoCheckResult]: Loop: "[95] L70-->L72: Formula: (= v_array_min_3 v_sampleThread1of1ForFork2_min_l_1) InVars {array_min=v_array_min_3} OutVars{array_min=v_array_min_3, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_1} AuxVars[] AssignedVars[sampleThread1of1ForFork2_min_l]" "[96] L72-->L74: Formula: (= v_array_max_6 v_sampleThread1of1ForFork2_max_l_1) InVars {array_max=v_array_max_6} OutVars{array_max=v_array_max_6, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_1} AuxVars[] AssignedVars[sampleThread1of1ForFork2_max_l]" "[97] L74-->L70: Formula: (= (+ v_sampleThread1of1ForFork2_diff_1 v_sampleThread1of1ForFork2_min_l_3) v_sampleThread1of1ForFork2_max_l_3) InVars {sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_3, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_3} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_1, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_3, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_3} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff]" [2025-04-26 16:53:56,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash 3478691, now seen corresponding path program 1 times [2025-04-26 16:53:56,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:56,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26753903] [2025-04-26 16:53:56,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:56,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:56,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:56,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:56,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:56,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:56,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:56,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:56,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,818 INFO L85 PathProgramCache]: Analyzing trace with hash 124159, now seen corresponding path program 1 times [2025-04-26 16:53:56,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:56,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693878600] [2025-04-26 16:53:56,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:56,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:56,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:56,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:56,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:56,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:56,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:56,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash 554562845, now seen corresponding path program 1 times [2025-04-26 16:53:56,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:56,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753550530] [2025-04-26 16:53:56,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:56,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:56,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:56,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:56,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:56,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:56,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:56,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:56,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:56,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:56,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:56,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:56,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:56,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,024 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:57,034 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:53:57 BoogieIcfgContainer [2025-04-26 16:53:57,035 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:53:57,036 INFO L158 Benchmark]: Toolchain (without parser) took 1261.93ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 95.1MB in the beginning and 314.4MB in the end (delta: -219.3MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. [2025-04-26 16:53:57,037 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:57,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.48ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 91.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:57,037 INFO L158 Benchmark]: Boogie Preprocessor took 18.41ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 90.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:53:57,037 INFO L158 Benchmark]: RCFGBuilder took 202.99ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 80.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:53:57,039 INFO L158 Benchmark]: BuchiAutomizer took 995.67ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 80.7MB in the beginning and 314.4MB in the end (delta: -233.7MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. [2025-04-26 16:53:57,041 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.20ms. Allocated memory is still 167.8MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.48ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 91.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.41ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 90.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 202.99ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 80.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 995.67ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 80.7MB in the beginning and 314.4MB in the end (delta: -233.7MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.8s 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.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 510, Number of transitions in reduction automaton: 1520, Number of states in reduction automaton: 857, 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: 70]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L83] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L85] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L86] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L87] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L71] min_l := array_min; [L72] max_l := array_max; [L74] diff := max_l - min_l; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 70]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L83] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L85] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L86] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L87] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L71] min_l := array_min; [L72] max_l := array_max; [L74] diff := max_l - min_l; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:53:57,055 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...