/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-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:25,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:25,581 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,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:25,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:25,589 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,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:25,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:25,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:25,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:25,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:25,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:25,612 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:25,612 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:25,612 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:25,612 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:25,612 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:25,612 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:25,612 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:25,612 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:25,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:25,613 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:25,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:25,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:25,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:25,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:25,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:25,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:25,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:25,614 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:25,614 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:25,614 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:25,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:25,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:25,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:25,855 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:25,856 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:25,857 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-subst.wvr.bpl [2025-04-26 18:40:25,857 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl' [2025-04-26 18:40:25,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:25,883 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:25,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:25,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:25,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:25,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,918 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:25,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:25,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:25,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:25,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:25,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "poker-hand-subst.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 L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "poker-hand-subst.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 L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:25,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:25,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:25,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:25,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/1) ... [2025-04-26 18:40:25,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:25,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:25,998 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:26,003 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:26,024 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:26,024 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:26,024 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:26,024 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:26,024 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:26,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:26,025 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:26,025 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:26,025 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,076 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:26,077 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:26,354 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:26,355 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:26,438 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:26,438 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-04-26 18:40:26,438 INFO L201 PluginConnector]: Adding new model poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:26 BoogieIcfgContainer [2025-04-26 18:40:26,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:26,439 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:26,439 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:26,462 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:26,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:26,463 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:25" (1/2) ... [2025-04-26 18:40:26,464 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20a60782 and model type poker-hand-subst.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,464 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:26,464 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:26" (2/2) ... [2025-04-26 18:40:26,465 INFO L376 chiAutomizerObserver]: Analyzing ICFG poker-hand-subst.wvr.bpl [2025-04-26 18:40:26,514 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:26,544 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:26,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:26,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,552 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,553 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,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 52 transitions, 125 flow [2025-04-26 18:40:26,626 INFO L116 PetriNetUnfolderBase]: 24/46 cut-off events. [2025-04-26 18:40:26,628 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:26,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 24/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 69 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 42. Up to 7 conditions per place. [2025-04-26 18:40:26,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 52 transitions, 125 flow [2025-04-26 18:40:26,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 46 transitions, 110 flow [2025-04-26 18:40:26,634 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 46 transitions, 110 flow [2025-04-26 18:40:26,634 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 46 transitions, 110 flow [2025-04-26 18:40:26,663 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 191 states, 189 states have (on average 6.507936507936508) internal successors, (in total 1230), 190 states have internal predecessors, (1230), 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,664 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 191 states, 189 states have (on average 6.507936507936508) internal successors, (in total 1230), 190 states have internal predecessors, (1230), 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,666 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:26,698 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 352#[L294, thread2EXIT, L215, thread1EXIT]true [2025-04-26 18:40:26,704 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 390#[L215, thread2EXIT, L295]true [2025-04-26 18:40:26,706 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 356#[L294, L243, thread2EXIT, thread1EXIT]true [2025-04-26 18:40:26,707 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 392#[thread2EXIT, L243, L295]true [2025-04-26 18:40:26,707 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 126#[thread1EXIT, L293, L131]true [2025-04-26 18:40:26,708 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 306#[L131, L294, L280, thread1EXIT]true [2025-04-26 18:40:26,711 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 372#[L131, thread3EXIT, L294, thread1EXIT]true [2025-04-26 18:40:26,712 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 374#[L131, L295, L280]true [2025-04-26 18:40:26,713 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310#[L131, L294, L215, thread1EXIT]true [2025-04-26 18:40:26,714 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376#[L215, L131, L295]true [2025-04-26 18:40:26,714 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 314#[L131, L294, L243, thread1EXIT]true [2025-04-26 18:40:26,718 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 378#[L131, L243, L295]true [2025-04-26 18:40:26,719 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 114#[thread1EXIT, L159, L293]true [2025-04-26 18:40:26,719 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 292#[L294, L159, L280, thread1EXIT]true [2025-04-26 18:40:26,720 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 362#[L159, L294, thread3EXIT, thread1EXIT]true [2025-04-26 18:40:26,720 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 364#[L159, L295, L280]true [2025-04-26 18:40:26,721 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 294#[L294, L159, L215, thread1EXIT]true [2025-04-26 18:40:26,721 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 366#[L215, L159, L295]true [2025-04-26 18:40:26,721 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 296#[L294, L159, L243, thread1EXIT]true [2025-04-26 18:40:26,723 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 368#[L159, L243, L295]true [2025-04-26 18:40:26,724 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 44#[L47, L292]true [2025-04-26 18:40:26,725 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 130#[thread2EXIT, L293, L47]true [2025-04-26 18:40:26,726 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 320#[L47, L294, thread2EXIT, L215]true [2025-04-26 18:40:26,729 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 322#[L47, L243, L294, thread2EXIT]true [2025-04-26 18:40:26,729 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 82#[L293, L131, L47]true [2025-04-26 18:40:26,730 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 232#[L47, L131, L294, L280]true [2025-04-26 18:40:26,731 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 328#[L131, L47, L294, thread3EXIT]true [2025-04-26 18:40:26,731 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 234#[L47, L131, L294, L215]true [2025-04-26 18:40:26,732 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 236#[L131, L47, L294, L243]true [2025-04-26 18:40:26,732 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78#[L159, L293, L47]true [2025-04-26 18:40:26,735 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 224#[L47, L159, L294, L280]true [2025-04-26 18:40:26,736 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 326#[thread3EXIT, L47, L294, L159]true [2025-04-26 18:40:26,736 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 226#[L47, L159, L294, L215]true [2025-04-26 18:40:26,736 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 228#[L243, L47, L159, L294]true [2025-04-26 18:40:26,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 46#[L292, L75]true [2025-04-26 18:40:26,738 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 144#[thread2EXIT, L75, L293]true [2025-04-26 18:40:26,741 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332#[L294, thread2EXIT, L215, L75]true [2025-04-26 18:40:26,741 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 334#[L243, L294, thread2EXIT, L75]true [2025-04-26 18:40:26,742 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 90#[L75, L293, L131]true [2025-04-26 18:40:26,742 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 254#[L131, L294, L75, L280]true [2025-04-26 18:40:26,743 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 340#[L131, L294, thread3EXIT, L75]true [2025-04-26 18:40:26,743 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 256#[L131, L294, L75, L215]true [2025-04-26 18:40:26,743 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 258#[L131, L294, L243, L75]true [2025-04-26 18:40:26,744 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 86#[L159, L75, L293]true [2025-04-26 18:40:26,744 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 246#[L159, L294, L280, L75]true [2025-04-26 18:40:26,744 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 338#[thread3EXIT, L294, L159, L75]true [2025-04-26 18:40:26,749 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 248#[L159, L294, L215, L75]true [2025-04-26 18:40:26,749 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 250#[L243, L159, L294, L75]true [2025-04-26 18:40:26,750 WARN L140 AmpleReduction]: Number of pruned transitions: 138 [2025-04-26 18:40:26,750 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 48 [2025-04-26 18:40:26,750 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 48 [2025-04-26 18:40:26,750 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:19 [2025-04-26 18:40:26,750 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:85 [2025-04-26 18:40:26,750 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:40:26,750 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:40:26,750 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:26,751 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 105 states, 103 states have (on average 2.8932038834951457) internal successors, (in total 298), 104 states have internal predecessors, (298), 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,758 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:26,758 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:26,758 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:26,759 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:26,759 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:26,759 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:26,759 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:26,759 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:26,761 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 105 states, 103 states have (on average 2.8932038834951457) internal successors, (in total 298), 104 states have internal predecessors, (298), 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,778 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 54 [2025-04-26 18:40:26,779 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:26,779 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:26,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:26,783 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:26,783 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:26,784 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 105 states, 103 states have (on average 2.8932038834951457) internal successors, (in total 298), 104 states have internal predecessors, (298), 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,790 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 54 [2025-04-26 18:40:26,790 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:26,790 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:26,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:26,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:26,795 INFO L752 eck$LassoCheckResult]: Stem: "[379] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[346] $Ultimate##0-->L47: Formula: (let ((.cse0 (select v_index_of_4_65 4)) (.cse1 (select v_index_of_0_65 4))) (and (= v_i1_13_20 0) (not v_break_14_21) (or (not (= (+ .cse0 1) 0)) (not (= (+ .cse1 1) 0))) (= .cse0 .cse1))) InVars {index_of_4=v_index_of_4_65, index_of_0=v_index_of_0_65} OutVars{index_of_4=v_index_of_4_65, i1_13=v_i1_13_20, break_14=v_break_14_21, index_of_0=v_index_of_0_65} AuxVars[] AssignedVars[i1_13, break_14]" [2025-04-26 18:40:26,796 INFO L754 eck$LassoCheckResult]: Loop: "[350] L47-->L47: Formula: (let ((.cse11 (select v_char_at_5_17 v_i1_13_17)) (.cse12 (select v_char_at_1_17 v_i1_13_17))) (let ((.cse4 (= 4 .cse12)) (.cse3 (= .cse12 0)) (.cse2 (= .cse11 0)) (.cse1 (= .cse11 4))) (let ((.cse7 (not .cse1)) (.cse9 (not .cse2)) (.cse8 (not .cse3)) (.cse10 (not .cse4))) (let ((.cse0 (not v_break_14_18)) (.cse6 (and .cse8 .cse10)) (.cse5 (and .cse7 .cse9))) (and (= (+ v_i1_13_17 1) v_i1_13_16) (or (and .cse0 (or .cse1 .cse2) (or .cse3 .cse4) (not v_break_14_17)) (and (or .cse5 .cse6 v_break_14_18) v_break_14_17)) .cse0 (= v_result_12_49 (ite (and .cse7 .cse8 .cse9 .cse10) 0 (ite .cse6 (- 1) (ite .cse5 1 v_result_12_50)))) (<= v_i1_13_17 12)))))) InVars {result_12=v_result_12_50, char_at_5=v_char_at_5_17, i1_13=v_i1_13_17, break_14=v_break_14_18, char_at_1=v_char_at_1_17} OutVars{result_12=v_result_12_49, char_at_5=v_char_at_5_17, i1_13=v_i1_13_16, break_14=v_break_14_17, char_at_1=v_char_at_1_17} AuxVars[] AssignedVars[result_12, i1_13, break_14]" [2025-04-26 18:40:26,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash 13056, now seen corresponding path program 1 times [2025-04-26 18:40:26,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629399310] [2025-04-26 18:40:26,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:26,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:26,855 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,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:26,861 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,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:26,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 381, now seen corresponding path program 1 times [2025-04-26 18:40:26,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941788822] [2025-04-26 18:40:26,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:26,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:26,896 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,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:26,903 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,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:26,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,909 INFO L85 PathProgramCache]: Analyzing trace with hash 405086, now seen corresponding path program 1 times [2025-04-26 18:40:26,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550413459] [2025-04-26 18:40:26,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:26,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:26,941 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,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:26,947 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,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:27,475 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:27,476 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:27,476 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:27,476 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:27,476 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:27,476 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,476 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:27,476 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:27,476 INFO L132 ssoRankerPreferences]: Filename of dumped script: poker-hand-subst.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:27,476 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:27,476 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:27,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:28,054 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2025-04-26 18:40:30,287 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:30,291 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:30,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:30,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:30,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:30,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:40:30,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:30,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:30,310 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:40:30,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:30,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:30,315 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:40:30,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:30,322 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:30,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:40:30,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:30,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:30,331 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:30,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:40:30,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:30,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:30,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:30,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:30,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:30,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:30,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:30,349 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:30,359 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:30,359 INFO L437 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:40:30,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:30,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:30,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:30,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:40:30,364 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:30,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:30,382 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:30,382 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:30,382 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1_13) = -2*i1_13 + 25 Supporting invariants [] [2025-04-26 18:40:30,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:30,392 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:30,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:30,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:30,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:30,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:30,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:30,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:30,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:30,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:30,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:30,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:30,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:30,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:30,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:30,462 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:30,463 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 105 states, 103 states have (on average 2.8932038834951457) internal successors, (in total 298), 104 states have internal predecessors, (298), 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) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:30,606 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 105 states, 103 states have (on average 2.8932038834951457) internal successors, (in total 298), 104 states have internal predecessors, (298), 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). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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) Result 238 states and 661 transitions. Complement of second has 5 states. [2025-04-26 18:40:30,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-26 18:40:30,617 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 18:40:30,620 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:30,620 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:40:30,620 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:30,620 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:40:30,620 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:30,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 661 transitions. [2025-04-26 18:40:30,629 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 75 [2025-04-26 18:40:30,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 131 states and 370 transitions. [2025-04-26 18:40:30,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2025-04-26 18:40:30,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2025-04-26 18:40:30,641 INFO L74 IsDeterministic]: Start isDeterministic. Operand 131 states and 370 transitions. [2025-04-26 18:40:30,642 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:30,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 131 states and 370 transitions. [2025-04-26 18:40:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 370 transitions. [2025-04-26 18:40:30,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 92. [2025-04-26 18:40:30,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 2.902173913043478) internal successors, (in total 267), 91 states have internal predecessors, (267), 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:30,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 267 transitions. [2025-04-26 18:40:30,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 267 transitions. [2025-04-26 18:40:30,667 INFO L438 stractBuchiCegarLoop]: Abstraction has 92 states and 267 transitions. [2025-04-26 18:40:30,667 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:30,667 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 267 transitions. [2025-04-26 18:40:30,668 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 51 [2025-04-26 18:40:30,668 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:30,668 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:30,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:30,668 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:30,672 INFO L752 eck$LassoCheckResult]: Stem: "[379] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[347] $Ultimate##0-->L75: Formula: (and (not v_break_16_17) (= (+ (select v_index_of_0_69 4) 1) 0) (= (+ (select v_index_of_4_69 4) 1) 0) (= v_i2_15_16 0) (let ((.cse0 (select v_count_occurrences_of_6_37 3))) (or (and (= .cse0 1) (not (= (+ (select v_index_of_4_69 2) 1) 0))) (< 1 .cse0))) (let ((.cse1 (select v_count_occurrences_of_2_45 3))) (or (and (not (= (+ (select v_index_of_0_69 2) 1) 0)) (= .cse1 1)) (< 1 .cse1))) (= (select v_last_index_of_7_23 3) (select v_last_index_of_3_29 3))) InVars {count_occurrences_of_2=v_count_occurrences_of_2_45, index_of_4=v_index_of_4_69, last_index_of_3=v_last_index_of_3_29, count_occurrences_of_6=v_count_occurrences_of_6_37, index_of_0=v_index_of_0_69, last_index_of_7=v_last_index_of_7_23} OutVars{count_occurrences_of_2=v_count_occurrences_of_2_45, last_index_of_7=v_last_index_of_7_23, index_of_4=v_index_of_4_69, last_index_of_3=v_last_index_of_3_29, count_occurrences_of_6=v_count_occurrences_of_6_37, i2_15=v_i2_15_16, index_of_0=v_index_of_0_69, break_16=v_break_16_17} AuxVars[] AssignedVars[i2_15, break_16]" [2025-04-26 18:40:30,672 INFO L754 eck$LassoCheckResult]: Loop: "[351] L75-->L75: Formula: (let ((.cse9 (select v_char_at_1_13 v_i2_15_8)) (.cse10 (select v_char_at_5_13 v_i2_15_8)) (.cse8 (= v_i2_15_8 (select v_last_index_of_3_15 3)))) (let ((.cse0 (not v_break_16_10)) (.cse1 (not .cse8)) (.cse4 (= 2 .cse10)) (.cse6 (= 3 .cse9)) (.cse5 (= 3 .cse10)) (.cse7 (= 2 .cse9))) (and .cse0 (= v_result_12_27 (let ((.cse2 (or .cse6 .cse7)) (.cse3 (or .cse4 .cse5))) (ite (and .cse1 .cse2 .cse3) 0 (ite (and .cse1 .cse2) (- 1) (ite (and .cse1 .cse3) 1 v_result_12_28))))) (or (and (or (and (not .cse7) (not .cse5) (not .cse6) (not .cse4)) .cse8) .cse0 (not v_break_16_9)) (and (or v_break_16_10 (and .cse1 (or .cse4 .cse6 .cse5 .cse7))) v_break_16_9)) (<= v_i2_15_8 12)))) InVars {result_12=v_result_12_28, char_at_5=v_char_at_5_13, last_index_of_3=v_last_index_of_3_15, char_at_1=v_char_at_1_13, i2_15=v_i2_15_8, break_16=v_break_16_10} OutVars{result_12=v_result_12_27, char_at_5=v_char_at_5_13, last_index_of_3=v_last_index_of_3_15, char_at_1=v_char_at_1_13, i2_15=v_i2_15_8, break_16=v_break_16_9} AuxVars[] AssignedVars[result_12, break_16]" [2025-04-26 18:40:30,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash 13057, now seen corresponding path program 1 times [2025-04-26 18:40:30,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:30,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189816182] [2025-04-26 18:40:30,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:30,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:30,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:30,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:30,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:30,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:30,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:30,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:30,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:30,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:30,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:30,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:30,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash 382, now seen corresponding path program 1 times [2025-04-26 18:40:30,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:30,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92698740] [2025-04-26 18:40:30,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:30,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:30,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:30,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:30,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:30,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:30,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:30,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:30,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:30,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:30,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:30,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash 405118, now seen corresponding path program 1 times [2025-04-26 18:40:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:30,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241843721] [2025-04-26 18:40:30,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:30,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:30,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:30,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:30,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:30,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:30,715 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:30,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:30,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:30,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:30,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:30,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:31,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:31,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:31,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:31,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:31,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:31,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:31,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:31,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:31,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:31,160 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:40:31,171 INFO L201 PluginConnector]: Adding new model poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:31 BoogieIcfgContainer [2025-04-26 18:40:31,171 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:31,172 INFO L158 Benchmark]: Toolchain (without parser) took 5288.66ms. Allocated memory was 167.8MB in the beginning and 188.7MB in the end (delta: 21.0MB). Free memory was 93.5MB in the beginning and 84.1MB in the end (delta: 9.4MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. [2025-04-26 18:40:31,173 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:31,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.98ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 91.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:31,173 INFO L158 Benchmark]: Boogie Preprocessor took 47.42ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 89.4MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:31,173 INFO L158 Benchmark]: RCFGBuilder took 469.17ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 49.2MB in the end (delta: 40.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-26 18:40:31,174 INFO L158 Benchmark]: BuchiAutomizer took 4732.39ms. Allocated memory was 167.8MB in the beginning and 188.7MB in the end (delta: 21.0MB). Free memory was 49.1MB in the beginning and 84.1MB in the end (delta: -35.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:31,175 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.98ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 91.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 47.42ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 89.4MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 469.17ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 49.2MB in the end (delta: 40.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 4732.39ms. Allocated memory was 167.8MB in the beginning and 188.7MB in the end (delta: 21.0MB). Free memory was 49.1MB in the beginning and 84.1MB in the end (delta: -35.0MB). 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 4.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 39 StatesRemovedByMinimization, 1 NontrivialMinimizations. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 10 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital204 mio100 ax100 hnf100 lsp495 ukn21 mio100 lsp94 div100 bol104 ite100 ukn100 eq193 hnf100 smp100 dnf1887 smp7 tf100 neg100 sie123 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 210, Number of transitions in reduction automaton: 298, Number of states in reduction automaton: 105, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * i1_13 + 25 and consists of 4 locations. The remainder module has 92 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 74]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L292] FORK 0 fork 1 thread1(); [L67] 1 assume !(index_of_0[4] != 0 - 1 || index_of_4[4] != 0 - 1); [L68] 1 assume count_occurrences_of_2[3] > 1 || (count_occurrences_of_2[3] == 1 && index_of_0[2] != 0 - 1); [L69] 1 assume count_occurrences_of_6[3] > 1 || (count_occurrences_of_6[3] == 1 && index_of_4[2] != 0 - 1); [L70] 1 assume last_index_of_3[3] == last_index_of_7[3]; [L71] 1 i2_15 := 0; [L72] 1 break_16 := false; VAL [break_16=false, i2_15=0] Loop: [L76] assume !break_16 && i2_15 <= 12; [L77] result_12 := (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3) && (char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then 0 else (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3) then 0 - 1 else (if i2_15 != last_index_of_3[3] && (char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then 1 else result_12))); [L78] break_16 := (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3 || char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then true else break_16); End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 74]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L292] FORK 0 fork 1 thread1(); [L67] 1 assume !(index_of_0[4] != 0 - 1 || index_of_4[4] != 0 - 1); [L68] 1 assume count_occurrences_of_2[3] > 1 || (count_occurrences_of_2[3] == 1 && index_of_0[2] != 0 - 1); [L69] 1 assume count_occurrences_of_6[3] > 1 || (count_occurrences_of_6[3] == 1 && index_of_4[2] != 0 - 1); [L70] 1 assume last_index_of_3[3] == last_index_of_7[3]; [L71] 1 i2_15 := 0; [L72] 1 break_16 := false; VAL [break_16=false, i2_15=0] Loop: [L76] assume !break_16 && i2_15 <= 12; [L77] result_12 := (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3) && (char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then 0 else (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3) then 0 - 1 else (if i2_15 != last_index_of_3[3] && (char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then 1 else result_12))); [L78] break_16 := (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3 || char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then true else break_16); End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:40:31,188 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...