/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-with_locks.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:22,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:22,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:22,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:22,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:22,981 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:22,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:23,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:23,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:23,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:23,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:23,004 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:23,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:23,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:23,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:23,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:23,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:23,005 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:23,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:23,005 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:23,005 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:23,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:23,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:23,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:23,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:23,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:23,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:23,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:23,007 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:23,007 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:23,007 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:23,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:23,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:23,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:23,230 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:23,231 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:23,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-with_locks.bpl [2025-04-26 18:39:23,234 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-with_locks.bpl' [2025-04-26 18:39:23,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:23,255 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:23,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:23,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:23,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:23,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,301 INFO L138 Inliner]: procedures = 8, calls = 11, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 37 [2025-04-26 18:39:23,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:23,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:23,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:23,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:23,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,311 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:23,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:23,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:23,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:23,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/1) ... [2025-04-26 18:39:23,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:23,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,347 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:23,351 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:23,368 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2025-04-26 18:39:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2025-04-26 18:39:23,369 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2025-04-26 18:39:23,369 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:23,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:23,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:23,369 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 18:39:23,369 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 18:39:23,369 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 18:39:23,369 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2025-04-26 18:39:23,369 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2025-04-26 18:39:23,369 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2025-04-26 18:39:23,370 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:23,410 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:23,411 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:23,476 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:23,476 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:23,487 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:23,488 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 18:39:23,488 INFO L201 PluginConnector]: Adding new model min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:23 BoogieIcfgContainer [2025-04-26 18:39:23,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:23,492 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:23,492 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:23,497 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:23,497 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:23,497 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:23" (1/2) ... [2025-04-26 18:39:23,498 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@445d80f4 and model type min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:23, skipping insertion in model container [2025-04-26 18:39:23,498 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:23,499 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:23" (2/2) ... [2025-04-26 18:39:23,500 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-sample-with_locks.bpl [2025-04-26 18:39:23,542 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:23,579 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:23,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:23,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,582 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:23,583 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:23,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 106 flow [2025-04-26 18:39:23,649 INFO L116 PetriNetUnfolderBase]: 3/38 cut-off events. [2025-04-26 18:39:23,650 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:23,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 38 events. 3/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-04-26 18:39:23,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 44 transitions, 106 flow [2025-04-26 18:39:23,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 38 transitions, 91 flow [2025-04-26 18:39:23,658 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 45 places, 38 transitions, 91 flow [2025-04-26 18:39:23,658 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 38 transitions, 91 flow [2025-04-26 18:39:23,750 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1251 states, 1249 states have (on average 2.963170536429143) internal successors, (in total 3701), 1250 states have internal predecessors, (3701), 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:23,753 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 1251 states, 1249 states have (on average 2.963170536429143) internal successors, (in total 3701), 1250 states have internal predecessors, (3701), 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:23,755 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:23,995 WARN L140 AmpleReduction]: Number of pruned transitions: 1097 [2025-04-26 18:39:23,995 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:23,995 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 48 [2025-04-26 18:39:23,995 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:134 [2025-04-26 18:39:23,995 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:741 [2025-04-26 18:39:23,995 WARN L145 AmpleReduction]: Times succ was already a loop node:54 [2025-04-26 18:39:23,995 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:209 [2025-04-26 18:39:23,995 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:23,997 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 924 states, 922 states have (on average 1.5976138828633406) internal successors, (in total 1473), 923 states have internal predecessors, (1473), 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,004 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:24,004 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:24,004 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:24,004 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:24,004 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:24,004 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:24,005 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:24,005 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:24,008 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 924 states, 922 states have (on average 1.5976138828633406) internal successors, (in total 1473), 923 states have internal predecessors, (1473), 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,040 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 723 [2025-04-26 18:39:24,040 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:24,040 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:24,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:24,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:24,047 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:24,049 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 924 states, 922 states have (on average 1.5976138828633406) internal successors, (in total 1473), 923 states have internal predecessors, (1473), 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,058 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 723 [2025-04-26 18:39:24,058 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:24,059 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:24,059 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:24,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:24,063 INFO L752 eck$LassoCheckResult]: Stem: "[135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0]" "[138] L74-->$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]" "[141] L75-->L60: 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,064 INFO L754 eck$LassoCheckResult]: Loop: "[114] L60-->L86: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[115] L86-->L86-1: Formula: (and v_min_lock_7 (not v_min_lock_8)) InVars {min_lock=v_min_lock_8} OutVars{min_lock=v_min_lock_7} AuxVars[] AssignedVars[min_lock]" "[116] L86-1-->L94: 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]" "[117] L94-->L91: Formula: (not v_min_lock_1) InVars {} OutVars{min_lock=v_min_lock_1} AuxVars[] AssignedVars[min_lock]" "[118] L91-->L100: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[119] L100-->L100-1: Formula: (and v_max_lock_11 (not v_max_lock_12)) InVars {max_lock=v_max_lock_12} OutVars{max_lock=v_max_lock_11} AuxVars[] AssignedVars[max_lock]" "[120] L100-1-->L108: 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]" "[121] L108-->L105: Formula: (not v_max_lock_6) InVars {} OutVars{max_lock=v_max_lock_6} AuxVars[] AssignedVars[max_lock]" "[122] L105-->L60: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:39:24,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash 163945, now seen corresponding path program 1 times [2025-04-26 18:39:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:24,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269845035] [2025-04-26 18:39:24,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:24,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:24,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:24,122 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,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,123 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:24,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:24,131 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,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:24,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:24,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1805295893, now seen corresponding path program 1 times [2025-04-26 18:39:24,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:24,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076674767] [2025-04-26 18:39:24,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:24,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:24,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:24,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:24,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:24,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:24,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:24,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:24,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:24,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1144919469, now seen corresponding path program 1 times [2025-04-26 18:39:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:24,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466691914] [2025-04-26 18:39:24,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:24,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:24,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:24,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:24,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:24,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:24,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:24,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:24,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:24,414 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,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:24,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:24,420 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,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:24,438 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,447 INFO L201 PluginConnector]: Adding new model min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:24 BoogieIcfgContainer [2025-04-26 18:39:24,448 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:24,451 INFO L158 Benchmark]: Toolchain (without parser) took 1193.05ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 84.0MB in the beginning and 90.0MB in the end (delta: -6.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:24,451 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.89ms. Allocated memory is still 159.4MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:24,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.96ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 81.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:24,452 INFO L158 Benchmark]: Boogie Preprocessor took 17.53ms. Allocated memory is still 159.4MB. Free memory was 81.4MB in the beginning and 80.5MB in the end (delta: 942.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:24,452 INFO L158 Benchmark]: RCFGBuilder took 166.28ms. Allocated memory is still 159.4MB. Free memory was 80.5MB in the beginning and 70.6MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:24,452 INFO L158 Benchmark]: BuchiAutomizer took 955.37ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 70.4MB in the beginning and 90.0MB in the end (delta: -19.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:24,453 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.89ms. Allocated memory is still 159.4MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.96ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 81.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.53ms. Allocated memory is still 159.4MB. Free memory was 81.4MB in the beginning and 80.5MB in the end (delta: 942.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 166.28ms. Allocated memory is still 159.4MB. Free memory was 80.5MB in the beginning and 70.6MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 955.37ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 70.4MB in the beginning and 90.0MB in the end (delta: -19.5MB). 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.8s and 1 iterations. TraceHistogramMax:1. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 421, Number of transitions in reduction automaton: 1473, Number of states in reduction automaton: 924, 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: 60]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L74] FORK 0 fork 1 computeMin(); [L75] FORK 0 fork 2, 2 computeMax(); [L76] FORK 0 fork 3, 3, 3 sample(); Loop: [L61] CALL call lock_min(); [L87] assume !min_lock; [L88] min_lock := true; [L61] RET call lock_min(); [L62] min_samples[i1 - 1] := array_min; [L63] CALL call release_min(); [L94] min_lock := false; [L63] RET call release_min(); [L65] CALL call lock_max(); [L101] assume !max_lock; [L102] max_lock := true; [L65] RET call lock_max(); [L66] max_samples[i2 - 1] := array_max; [L67] CALL call release_max(); [L108] max_lock := false; [L67] RET call release_max(); End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 60]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L74] FORK 0 fork 1 computeMin(); [L75] FORK 0 fork 2, 2 computeMax(); [L76] FORK 0 fork 3, 3, 3 sample(); Loop: [L61] CALL call lock_min(); [L87] assume !min_lock; [L88] min_lock := true; [L61] RET call lock_min(); [L62] min_samples[i1 - 1] := array_min; [L63] CALL call release_min(); [L94] min_lock := false; [L63] RET call release_min(); [L65] CALL call lock_max(); [L101] assume !max_lock; [L102] max_lock := true; [L65] RET call lock_max(); [L66] max_samples[i2 - 1] := array_max; [L67] CALL call release_max(); [L108] max_lock := false; [L67] RET call release_max(); End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:39:24,468 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...