/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-nonatomic.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:19,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:19,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:19,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:19,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:19,486 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:19,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:19,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:19,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:19,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:19,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:19,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:19,500 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:19,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:19,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:19,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:19,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:19,501 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:19,501 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:19,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:19,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:19,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:19,709 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:19,710 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:19,712 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-nonatomic.bpl [2025-04-26 18:39:19,712 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-nonatomic.bpl' [2025-04-26 18:39:19,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:19,735 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:19,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:19,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:19,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:19,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,766 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:19,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:19,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:19,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:19,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:19,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:19,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:19,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:19,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:19,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/1) ... [2025-04-26 18:39:19,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:19,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:19,814 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:19,816 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:19,836 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2025-04-26 18:39:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2025-04-26 18:39:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2025-04-26 18:39:19,836 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:19,836 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 18:39:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 18:39:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 18:39:19,837 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2025-04-26 18:39:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2025-04-26 18:39:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2025-04-26 18:39:19,837 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2025-04-26 18:39:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2025-04-26 18:39:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2025-04-26 18:39:19,837 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:19,871 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:19,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:19,975 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:19,975 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:19,984 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:19,984 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 18:39:19,985 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:19 BoogieIcfgContainer [2025-04-26 18:39:19,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:19,986 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:19,986 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:19,990 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:19,990 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:19,990 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:19" (1/2) ... [2025-04-26 18:39:19,991 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e508cc1 and model type min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:19, skipping insertion in model container [2025-04-26 18:39:19,992 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:19,992 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:19" (2/2) ... [2025-04-26 18:39:19,992 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs-nonatomic.bpl [2025-04-26 18:39:20,062 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:39:20,099 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:20,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:20,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,116 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:20,117 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:20,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 122 flow [2025-04-26 18:39:20,186 INFO L116 PetriNetUnfolderBase]: 6/39 cut-off events. [2025-04-26 18:39:20,188 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:39:20,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 6/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 97 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-04-26 18:39:20,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 47 transitions, 122 flow [2025-04-26 18:39:20,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 102 flow [2025-04-26 18:39:20,194 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 46 places, 39 transitions, 102 flow [2025-04-26 18:39:20,194 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 39 transitions, 102 flow [2025-04-26 18:39:20,324 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2091 states, 2089 states have (on average 4.175203446625179) internal successors, (in total 8722), 2090 states have internal predecessors, (8722), 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:20,330 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 2091 states, 2089 states have (on average 4.175203446625179) internal successors, (in total 8722), 2090 states have internal predecessors, (8722), 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:20,333 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:20,515 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2681#[L81, L72, computeMinEXIT, L46]true [2025-04-26 18:39:20,517 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1227#[L45-2, L80, computeMinEXIT]true [2025-04-26 18:39:20,611 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 781#[L68, L45, L81, L29]true [2025-04-26 18:39:20,613 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4023#[L82, mapAbsEXIT, L70, L46, L30]true [2025-04-26 18:39:20,616 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3365#[L68, L82, mapAbsEXIT, L45-2, L29]true [2025-04-26 18:39:20,633 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2683#[L81, L72, L30, L46]true [2025-04-26 18:39:20,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1233#[L30, L45-2, L80]true [2025-04-26 18:39:20,650 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1807#[L82, L29-2, L58-1, L72, $Ultimate##0]true [2025-04-26 18:39:20,650 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 121#[L68, $Ultimate##0, L28-1, L81]true [2025-04-26 18:39:20,650 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 131#[L29-2, L79]true [2025-04-26 18:39:20,657 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2591#[L82, mapAbsEXIT, $Ultimate##0, L46, L72]true [2025-04-26 18:39:20,663 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173#[$Ultimate##0, L45-2, L80]true [2025-04-26 18:39:20,666 WARN L140 AmpleReduction]: Number of pruned transitions: 3317 [2025-04-26 18:39:20,666 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 12 [2025-04-26 18:39:20,666 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 384 [2025-04-26 18:39:20,666 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:62 [2025-04-26 18:39:20,666 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1191 [2025-04-26 18:39:20,666 WARN L145 AmpleReduction]: Times succ was already a loop node:276 [2025-04-26 18:39:20,666 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1114 [2025-04-26 18:39:20,666 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:20,670 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 1626 states, 1624 states have (on average 2.1613300492610836) internal successors, (in total 3510), 1625 states have internal predecessors, (3510), 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:20,676 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:20,676 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:20,676 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:20,677 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:20,677 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:20,677 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:20,677 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:20,677 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:20,701 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1626 states, 1624 states have (on average 2.1613300492610836) internal successors, (in total 3510), 1625 states have internal predecessors, (3510), 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:20,748 INFO L131 ngComponentsAnalysis]: Automaton has 124 accepting balls. 1316 [2025-04-26 18:39:20,749 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:20,749 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:20,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:20,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:20,753 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:20,755 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1626 states, 1624 states have (on average 2.1613300492610836) internal successors, (in total 3510), 1625 states have internal predecessors, (3510), 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:20,772 INFO L131 ngComponentsAnalysis]: Automaton has 124 accepting balls. 1316 [2025-04-26 18:39:20,772 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:20,772 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:20,772 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:20,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:20,776 INFO L752 eck$LassoCheckResult]: Stem: "[131] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0]" "[134] L79-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_18, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1]" "[137] L80-->L68: 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 18:39:20,777 INFO L754 eck$LassoCheckResult]: Loop: "[117] L68-->L70: 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]" "[118] L70-->L72: Formula: (= v_array_max_7 v_sampleThread1of1ForFork2_max_l_1) InVars {array_max=v_array_max_7} OutVars{array_max=v_array_max_7, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_1} AuxVars[] AssignedVars[sampleThread1of1ForFork2_max_l]" "[119] L72-->L68: 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 18:39:20,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash 159973, now seen corresponding path program 1 times [2025-04-26 18:39:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:20,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877569774] [2025-04-26 18:39:20,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:20,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:20,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:20,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:20,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:20,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:20,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:20,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:20,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash 146005, now seen corresponding path program 1 times [2025-04-26 18:39:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:20,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35088149] [2025-04-26 18:39:20,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:20,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:20,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:20,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:20,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:20,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:20,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:20,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:20,861 INFO L85 PathProgramCache]: Analyzing trace with hash 470904561, now seen corresponding path program 1 times [2025-04-26 18:39:20,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:20,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265874192] [2025-04-26 18:39:20,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:20,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:20,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:20,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:20,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:20,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:20,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:20,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:20,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:20,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:20,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:20,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:21,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:21,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:21,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:21,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:21,027 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:21 BoogieIcfgContainer [2025-04-26 18:39:21,027 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:21,030 INFO L158 Benchmark]: Toolchain (without parser) took 1292.92ms. Allocated memory was 159.4MB in the beginning and 318.8MB in the end (delta: 159.4MB). Free memory was 85.3MB in the beginning and 240.1MB in the end (delta: -154.8MB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. [2025-04-26 18:39:21,031 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 86.3MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:21,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.70ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:21,031 INFO L158 Benchmark]: Boogie Preprocessor took 24.72ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 82.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:21,031 INFO L158 Benchmark]: RCFGBuilder took 191.93ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 72.4MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:21,032 INFO L158 Benchmark]: BuchiAutomizer took 1041.38ms. Allocated memory was 159.4MB in the beginning and 318.8MB in the end (delta: 159.4MB). Free memory was 72.4MB in the beginning and 240.1MB in the end (delta: -167.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:21,033 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.24ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 86.3MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.70ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.72ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 82.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 191.93ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 72.4MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1041.38ms. Allocated memory was 159.4MB in the beginning and 318.8MB in the end (delta: 159.4MB). Free memory was 72.4MB in the beginning and 240.1MB in the end (delta: -167.7MB). 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.9s 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]: 571, Number of transitions in reduction automaton: 3510, Number of states in reduction automaton: 1626, 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: 68]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L79] FORK 0 fork 1 computeMin(); [L80] FORK 0 fork 2, 2 computeMax(); [L81] FORK 0 fork 3, 3, 3 sample(); Loop: [L69] min_l := array_min; [L70] max_l := array_max; [L72] diff := max_l - min_l; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 68]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L79] FORK 0 fork 1 computeMin(); [L80] FORK 0 fork 2, 2 computeMax(); [L81] FORK 0 fork 3, 3, 3 sample(); Loop: [L69] min_l := array_min; [L70] max_l := array_max; [L72] diff := max_l - min_l; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:39:21,072 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...