/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/weaver-benchmarks/generated/chl/poker-hand-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:25,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:25,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:25,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:25,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:25,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:25,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:25,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:25,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:25,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:25,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:25,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:25,631 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:25,631 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:25,631 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:25,631 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:25,631 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:25,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:25,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:25,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:25,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:25,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:25,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:25,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:25,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:25,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:25,633 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:25,633 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:25,633 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:25,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:25,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:25,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:25,834 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:25,834 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:25,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-symm.wvr.bpl [2025-04-26 18:40:25,835 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-symm.wvr.bpl' [2025-04-26 18:40:25,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:25,859 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:25,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:25,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:25,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:25,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,895 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:25,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:25,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:25,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:25,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:25,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:25,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:25,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:25,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:25,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:25,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:25,957 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:40:25,961 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:40:25,981 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:25,981 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:25,981 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:25,981 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:25,981 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:25,981 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:25,981 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:25,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:25,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:25,982 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:40:26,025 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:26,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:26,276 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:26,276 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:26,380 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:26,380 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-26 18:40:26,381 INFO L201 PluginConnector]: Adding new model poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:26 BoogieIcfgContainer [2025-04-26 18:40:26,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:26,382 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:26,383 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:26,387 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:26,387 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:26,388 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/2) ... [2025-04-26 18:40:26,389 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@693f4ffa and model type poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:26, skipping insertion in model container [2025-04-26 18:40:26,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:26,389 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:26" (2/2) ... [2025-04-26 18:40:26,390 INFO L376 chiAutomizerObserver]: Analyzing ICFG poker-hand-symm.wvr.bpl [2025-04-26 18:40:26,437 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:40:26,476 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:26,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:26,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,479 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:40:26,498 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:40:26,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 36 transitions, 86 flow [2025-04-26 18:40:26,574 INFO L116 PetriNetUnfolderBase]: 16/32 cut-off events. [2025-04-26 18:40:26,575 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:40:26,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 16/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 41 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 27. Up to 7 conditions per place. [2025-04-26 18:40:26,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 36 transitions, 86 flow [2025-04-26 18:40:26,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 32 transitions, 76 flow [2025-04-26 18:40:26,581 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 23 places, 32 transitions, 76 flow [2025-04-26 18:40:26,582 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 32 transitions, 76 flow [2025-04-26 18:40:26,594 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 41 states, 39 states have (on average 4.102564102564102) internal successors, (in total 160), 40 states have internal predecessors, (160), 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:40:26,595 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 41 states, 39 states have (on average 4.102564102564102) internal successors, (in total 160), 40 states have internal predecessors, (160), 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:40:26,597 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:26,624 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78#[thread1EXIT, L200, L122]true [2025-04-26 18:40:26,624 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 82#[thread1EXIT, L200, L150]true [2025-04-26 18:40:26,627 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 36#[L199, L66]true [2025-04-26 18:40:26,628 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 62#[L66, L122, L200]true [2025-04-26 18:40:26,628 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 66#[L66, L150, L200]true [2025-04-26 18:40:26,629 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 38#[L199, L38]true [2025-04-26 18:40:26,633 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 68#[L38, L122, L200]true [2025-04-26 18:40:26,633 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 72#[L38, L150, L200]true [2025-04-26 18:40:26,634 WARN L140 AmpleReduction]: Number of pruned transitions: 20 [2025-04-26 18:40:26,634 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 8 [2025-04-26 18:40:26,634 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 8 [2025-04-26 18:40:26,634 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:14 [2025-04-26 18:40:26,634 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:16 [2025-04-26 18:40:26,634 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:40:26,634 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:40:26,634 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:26,634 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 31 states, 29 states have (on average 2.413793103448276) internal successors, (in total 70), 30 states have internal predecessors, (70), 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:40:26,640 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:26,640 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:26,640 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:26,640 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:26,640 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:26,640 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:26,640 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:26,640 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:26,642 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 29 states have (on average 2.413793103448276) internal successors, (in total 70), 30 states have internal predecessors, (70), 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:40:26,650 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2025-04-26 18:40:26,650 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:26,650 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:26,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:26,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:26,655 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:26,655 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 29 states have (on average 2.413793103448276) internal successors, (in total 70), 30 states have internal predecessors, (70), 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:40:26,658 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2025-04-26 18:40:26,658 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:26,658 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:26,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:26,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:26,662 INFO L752 eck$LassoCheckResult]: Stem: "[256] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[233] $Ultimate##0-->L66: Formula: (and (let ((.cse0 (select v_count_occurrences_of_6_37 3))) (or (< 1 .cse0) (and (not (= (+ 1 (select v_index_of_4_63 2)) 0)) (= .cse0 1)))) (= v_i2_11_14 0) (= (+ (select v_index_of_4_63 4) 1) 0) (= (select v_last_index_of_7_23 3) (select v_last_index_of_3_25 3)) (not v_break_12_15) (= (+ (select v_index_of_0_63 4) 1) 0) (let ((.cse1 (select v_count_occurrences_of_2_41 3))) (or (and (not (= (+ (select v_index_of_0_63 2) 1) 0)) (= .cse1 1)) (< 1 .cse1)))) InVars {count_occurrences_of_2=v_count_occurrences_of_2_41, index_of_4=v_index_of_4_63, last_index_of_3=v_last_index_of_3_25, count_occurrences_of_6=v_count_occurrences_of_6_37, index_of_0=v_index_of_0_63, last_index_of_7=v_last_index_of_7_23} OutVars{count_occurrences_of_2=v_count_occurrences_of_2_41, i2_11=v_i2_11_14, break_12=v_break_12_15, last_index_of_7=v_last_index_of_7_23, index_of_4=v_index_of_4_63, last_index_of_3=v_last_index_of_3_25, count_occurrences_of_6=v_count_occurrences_of_6_37, index_of_0=v_index_of_0_63} AuxVars[] AssignedVars[i2_11, break_12]" [2025-04-26 18:40:26,662 INFO L754 eck$LassoCheckResult]: Loop: "[239] L66-->L66: Formula: (let ((.cse9 (select v_char_at_1_17 v_i2_11_16)) (.cse10 (select v_char_at_5_17 v_i2_11_16)) (.cse5 (= v_i2_11_16 (select v_last_index_of_3_29 3)))) (let ((.cse0 (not v_break_12_18)) (.cse6 (not .cse5)) (.cse3 (= .cse10 3)) (.cse2 (= .cse10 2)) (.cse4 (= .cse9 3)) (.cse1 (= .cse9 2))) (and .cse0 (<= v_i2_11_16 12) (or (and (not v_break_12_17) (or (and (not .cse1) (not .cse2) (not .cse3) (not .cse4)) .cse5) .cse0) (and v_break_12_17 (or v_break_12_18 (and .cse6 (or .cse4 .cse3 .cse2 .cse1))))) (= v_result_8_53 (let ((.cse7 (or .cse4 .cse1)) (.cse8 (or .cse3 .cse2))) (ite (and .cse7 .cse6 .cse8) 0 (ite (and .cse7 .cse6) (- 1) (ite (and .cse6 .cse8) 1 v_result_8_54)))))))) InVars {result_8=v_result_8_54, i2_11=v_i2_11_16, char_at_5=v_char_at_5_17, break_12=v_break_12_18, last_index_of_3=v_last_index_of_3_29, char_at_1=v_char_at_1_17} OutVars{result_8=v_result_8_53, i2_11=v_i2_11_16, char_at_5=v_char_at_5_17, break_12=v_break_12_17, last_index_of_3=v_last_index_of_3_29, char_at_1=v_char_at_1_17} AuxVars[] AssignedVars[result_8, break_12]" [2025-04-26 18:40:26,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 9130, now seen corresponding path program 1 times [2025-04-26 18:40:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092541026] [2025-04-26 18:40:26,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:26,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:26,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:26,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:26,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:26,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash 270, now seen corresponding path program 1 times [2025-04-26 18:40:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103438918] [2025-04-26 18:40:26,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:26,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:26,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,757 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:26,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:26,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:26,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,764 INFO L85 PathProgramCache]: Analyzing trace with hash 283269, now seen corresponding path program 1 times [2025-04-26 18:40:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67592570] [2025-04-26 18:40:26,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:26,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:26,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:26,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:26,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:27,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:27,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:27,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:27,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:27,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:27,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:27,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:27,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:27,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:27,454 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:40:27,466 INFO L201 PluginConnector]: Adding new model poker-hand-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:27 BoogieIcfgContainer [2025-04-26 18:40:27,466 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:27,467 INFO L158 Benchmark]: Toolchain (without parser) took 1607.78ms. Allocated memory was 155.2MB in the beginning and 318.8MB in the end (delta: 163.6MB). Free memory was 83.8MB in the beginning and 272.1MB in the end (delta: -188.3MB). Peak memory consumption was 51.5MB. Max. memory is 8.0GB. [2025-04-26 18:40:27,468 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:27,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.88ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 81.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:27,468 INFO L158 Benchmark]: Boogie Preprocessor took 32.05ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:27,468 INFO L158 Benchmark]: RCFGBuilder took 450.74ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 50.9MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:27,469 INFO L158 Benchmark]: BuchiAutomizer took 1083.71ms. Allocated memory was 155.2MB in the beginning and 318.8MB in the end (delta: 163.6MB). Free memory was 50.7MB in the beginning and 272.1MB in the end (delta: -221.5MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. [2025-04-26 18:40:27,472 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.18ms. Allocated memory is still 155.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.88ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 81.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.05ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 450.74ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 50.9MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1083.71ms. Allocated memory was 155.2MB in the beginning and 318.8MB in the end (delta: 163.6MB). Free memory was 50.7MB in the beginning and 272.1MB in the end (delta: -221.5MB). Peak memory consumption was 18.0MB. 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.7s. 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.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 162, Number of transitions in reduction automaton: 70, Number of states in reduction automaton: 31, 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: 65]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L199] FORK 0 fork 1 thread1(); [L58] 1 assume !(index_of_0[4] != 0 - 1 || index_of_4[4] != 0 - 1); [L59] 1 assume count_occurrences_of_2[3] > 1 || (count_occurrences_of_2[3] == 1 && index_of_0[2] != 0 - 1); [L60] 1 assume count_occurrences_of_6[3] > 1 || (count_occurrences_of_6[3] == 1 && index_of_4[2] != 0 - 1); [L61] 1 assume last_index_of_3[3] == last_index_of_7[3]; [L62] 1 i2_11 := 0; [L63] 1 break_12 := false; VAL [break_12=false, i2_11=0] Loop: [L67] assume !break_12 && i2_11 <= 12; [L68] result_8 := (if i2_11 != last_index_of_3[3] && (char_at_1[i2_11] == 2 || char_at_1[i2_11] == 3) && (char_at_5[i2_11] == 2 || char_at_5[i2_11] == 3) then 0 else (if i2_11 != last_index_of_3[3] && (char_at_1[i2_11] == 2 || char_at_1[i2_11] == 3) then 0 - 1 else (if i2_11 != last_index_of_3[3] && (char_at_5[i2_11] == 2 || char_at_5[i2_11] == 3) then 1 else result_8))); [L69] break_12 := (if i2_11 != last_index_of_3[3] && (char_at_1[i2_11] == 2 || char_at_1[i2_11] == 3 || char_at_5[i2_11] == 2 || char_at_5[i2_11] == 3) then true else break_12); End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 65]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L199] FORK 0 fork 1 thread1(); [L58] 1 assume !(index_of_0[4] != 0 - 1 || index_of_4[4] != 0 - 1); [L59] 1 assume count_occurrences_of_2[3] > 1 || (count_occurrences_of_2[3] == 1 && index_of_0[2] != 0 - 1); [L60] 1 assume count_occurrences_of_6[3] > 1 || (count_occurrences_of_6[3] == 1 && index_of_4[2] != 0 - 1); [L61] 1 assume last_index_of_3[3] == last_index_of_7[3]; [L62] 1 i2_11 := 0; [L63] 1 break_12 := false; VAL [break_12=false, i2_11=0] Loop: [L67] assume !break_12 && i2_11 <= 12; [L68] result_8 := (if i2_11 != last_index_of_3[3] && (char_at_1[i2_11] == 2 || char_at_1[i2_11] == 3) && (char_at_5[i2_11] == 2 || char_at_5[i2_11] == 3) then 0 else (if i2_11 != last_index_of_3[3] && (char_at_1[i2_11] == 2 || char_at_1[i2_11] == 3) then 0 - 1 else (if i2_11 != last_index_of_3[3] && (char_at_5[i2_11] == 2 || char_at_5[i2_11] == 3) then 1 else result_8))); [L69] break_12 := (if i2_11 != last_index_of_3[3] && (char_at_1[i2_11] == 2 || char_at_1[i2_11] == 3 || char_at_5[i2_11] == 2 || char_at_5[i2_11] == 3) then true else break_12); End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:40:27,502 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...