/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/name-comparator-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:18,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:18,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:18,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:18,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:18,877 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:18,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:18,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:18,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:18,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:18,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:18,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:18,889 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:18,890 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:18,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:18,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:18,891 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:18,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:18,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:18,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:18,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:18,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:18,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:18,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:18,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:18,891 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:18,891 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:18,891 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:19,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:19,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:19,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:19,167 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:19,167 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:19,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-subst.wvr.bpl [2025-04-26 18:40:19,169 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-subst.wvr.bpl' [2025-04-26 18:40:19,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:19,188 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:19,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:19,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:19,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:19,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,222 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:19,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:19,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:19,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:19,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:19,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:19,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:19,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:19,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:19,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/1) ... [2025-04-26 18:40:19,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:19,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:19,279 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:19,284 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:19,307 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:19,307 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:19,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:19,308 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:19,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:19,308 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:19,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:19,308 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:19,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:19,308 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:19,353 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:19,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:19,493 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:19,493 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:19,568 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:19,568 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 18:40:19,569 INFO L201 PluginConnector]: Adding new model name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:19 BoogieIcfgContainer [2025-04-26 18:40:19,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:19,569 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:19,569 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:19,574 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:19,574 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:19,574 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:19" (1/2) ... [2025-04-26 18:40:19,575 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ed7081a and model type name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:19, skipping insertion in model container [2025-04-26 18:40:19,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:19,575 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:19" (2/2) ... [2025-04-26 18:40:19,577 INFO L376 chiAutomizerObserver]: Analyzing ICFG name-comparator-subst.wvr.bpl [2025-04-26 18:40:19,623 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:19,650 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:19,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:19,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:19,653 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:19,654 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:19,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 18:40:19,737 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 18:40:19,739 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:19,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 18:40:19,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 18:40:19,763 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:19,763 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:19,764 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:19,780 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 110 states, 108 states have (on average 2.8703703703703702) internal successors, (in total 310), 109 states have internal predecessors, (310), 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:19,780 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 110 states, 108 states have (on average 2.8703703703703702) internal successors, (in total 310), 109 states have internal predecessors, (310), 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:19,782 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:19,808 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199#[L88, thread2EXIT, thread1EXIT, L109]true [2025-04-26 18:40:19,822 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 219#[L110, thread2EXIT, L88]true [2025-04-26 18:40:19,823 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 85#[L108, L62, thread1EXIT]true [2025-04-26 18:40:19,824 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 175#[L88, thread2FINAL, thread1EXIT, L109]true [2025-04-26 18:40:19,825 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 201#[L110, L88, thread2FINAL]true [2025-04-26 18:40:19,825 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 147#[L62, L88, thread1EXIT, L109]true [2025-04-26 18:40:19,825 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179#[L62, thread3FINAL, thread1EXIT, L109]true [2025-04-26 18:40:19,826 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 207#[L62, thread3EXIT, thread1EXIT, L109]true [2025-04-26 18:40:19,826 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 205#[L62, L110, thread3FINAL]true [2025-04-26 18:40:19,826 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 177#[L62, L110, L88]true [2025-04-26 18:40:19,827 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39#[L107, L36]true [2025-04-26 18:40:19,828 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 67#[L108, L62, thread1FINAL]true [2025-04-26 18:40:19,832 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 155#[thread1FINAL, L88, thread2FINAL, L109]true [2025-04-26 18:40:19,833 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 123#[L62, thread1FINAL, L88, L109]true [2025-04-26 18:40:19,833 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 157#[thread1FINAL, L62, thread3FINAL, L109]true [2025-04-26 18:40:19,834 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 189#[L62, thread1FINAL, thread3EXIT, L109]true [2025-04-26 18:40:19,834 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 55#[L36, L62, L108]true [2025-04-26 18:40:19,834 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 71#[L36, thread2FINAL, L108]true [2025-04-26 18:40:19,835 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 95#[L36, thread2EXIT, L108]true [2025-04-26 18:40:19,842 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 185#[thread1FINAL, L88, thread2EXIT, L109]true [2025-04-26 18:40:19,842 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 161#[L88, L36, thread2EXIT, L109]true [2025-04-26 18:40:19,843 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 191#[thread3FINAL, L36, thread2EXIT, L109]true [2025-04-26 18:40:19,843 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 129#[L88, L36, thread2FINAL, L109]true [2025-04-26 18:40:19,844 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 163#[thread3FINAL, L36, thread2FINAL, L109]true [2025-04-26 18:40:19,844 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 193#[thread3EXIT, L36, thread2FINAL, L109]true [2025-04-26 18:40:19,845 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 99#[L62, L88, L36, L109]true [2025-04-26 18:40:19,845 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 131#[L62, thread3FINAL, L36, L109]true [2025-04-26 18:40:19,845 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 165#[L62, thread3EXIT, L36, L109]true [2025-04-26 18:40:19,850 WARN L140 AmpleReduction]: Number of pruned transitions: 45 [2025-04-26 18:40:19,850 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 28 [2025-04-26 18:40:19,850 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 28 [2025-04-26 18:40:19,850 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:16 [2025-04-26 18:40:19,850 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:49 [2025-04-26 18:40:19,850 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:40:19,850 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:40:19,850 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:19,851 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:19,864 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:19,864 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:19,864 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:19,864 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:19,864 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:19,864 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:19,864 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:19,864 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:19,866 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:19,880 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 18:40:19,880 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:19,880 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:19,885 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:19,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:19,885 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:19,886 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:19,890 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 18:40:19,892 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:19,892 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:19,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:19,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:19,898 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_62)) (.cse1 (= v_name_1_15 v_name_2_15))) (and (= v_i_5_7 0) .cse0 (= (ite .cse1 0 v_result_4_19) v_result_4_18) (or (and (or .cse1 v_break_7_62) v_break_7_20) (and .cse0 (not .cse1) (not v_break_7_20))))) InVars {result_4=v_result_4_19, name_2=v_name_2_15, name_1=v_name_1_15} OutVars{name_2=v_name_2_15, i_5=v_i_5_7, result_4=v_result_4_18, break_7=v_break_7_20, name_1=v_name_1_15} AuxVars[v_break_7_62] AssignedVars[i_5, result_4, break_7]" [2025-04-26 18:40:19,900 INFO L754 eck$LassoCheckResult]: Loop: "[118] L36-->L36: Formula: (let ((.cse3 (= v_name_2_29 v_current_6_16)) (.cse1 (not v_break_7_64))) (let ((.cse4 (and .cse3 .cse1)) (.cse0 (= v_name_1_25 v_current_6_16)) (.cse2 (not v_break_7_53))) (and (= v_current_6_16 (select v_nondet_0_6 v_i_5_32)) (< v_i_5_32 3) (= v_i_5_31 (+ v_i_5_32 1)) (or (and (or .cse0 v_break_7_53) v_break_7_64) (and (not .cse0) .cse1 .cse2)) (or (and (not v_break_7_52) (or v_break_7_64 (not .cse3)) .cse1) (and (or v_break_7_64 .cse4) v_break_7_52)) (= v_result_4_44 (ite .cse4 (- 1) (ite .cse0 1 v_result_4_45))) .cse2))) InVars {name_2=v_name_2_29, i_5=v_i_5_32, nondet_0=v_nondet_0_6, result_4=v_result_4_45, break_7=v_break_7_53, name_1=v_name_1_25} OutVars{name_2=v_name_2_29, i_5=v_i_5_31, result_4=v_result_4_44, break_7=v_break_7_52, current_6=v_current_6_16, name_1=v_name_1_25, nondet_0=v_nondet_0_6} AuxVars[v_break_7_64] AssignedVars[i_5, result_4, break_7, current_6]" [2025-04-26 18:40:19,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:19,904 INFO L85 PathProgramCache]: Analyzing trace with hash 5107, now seen corresponding path program 1 times [2025-04-26 18:40:19,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:19,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116067563] [2025-04-26 18:40:19,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:19,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:19,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:19,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:19,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:19,961 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:19,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:19,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:19,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:19,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:19,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:19,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2025-04-26 18:40:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:19,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529004923] [2025-04-26 18:40:19,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:19,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:19,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:19,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:19,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:19,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:19,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:19,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:19,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:19,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:19,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:20,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:20,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash 158435, now seen corresponding path program 1 times [2025-04-26 18:40:20,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:20,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659534655] [2025-04-26 18:40:20,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:20,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:20,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:20,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:20,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:20,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:20,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:20,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:20,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:20,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:20,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:20,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:20,556 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:20,556 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:20,557 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:20,557 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:20,557 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:20,557 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:20,557 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:20,557 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:20,557 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-subst.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:20,557 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:20,557 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:20,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:20,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:20,779 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 18:40:21,078 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:21,080 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:21,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:21,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:21,087 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:21,088 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:21,089 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:21,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:21,101 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 18:40:21,101 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-04-26 18:40:21,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:21,223 INFO L402 nArgumentSynthesizer]: We have 154 Motzkin's Theorem applications. [2025-04-26 18:40:21,223 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-04-26 18:40:21,380 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:21,389 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:21,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:21,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:21,391 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:21,392 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:21,394 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:21,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:21,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:21,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:21,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:21,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:21,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:21,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:21,422 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:40:21,422 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 18:40:21,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:21,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:21,426 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:21,428 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:21,429 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:21,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:40:21,451 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:21,451 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:21,451 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_5) = -2*i_5 + 5 Supporting invariants [] [2025-04-26 18:40:21,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:40:21,461 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:21,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:21,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:21,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:21,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:21,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:21,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:21,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:21,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:21,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:21,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:21,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:21,512 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:21,527 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:21,528 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:21,601 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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 167 states and 409 transitions. Complement of second has 5 states. [2025-04-26 18:40:21,603 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:21,606 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:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-26 18:40:21,613 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 18:40:21,613 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:21,614 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:40:21,614 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:21,614 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:40:21,614 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:21,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 409 transitions. [2025-04-26 18:40:21,622 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 18:40:21,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 83 states and 205 transitions. [2025-04-26 18:40:21,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 18:40:21,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 18:40:21,630 INFO L74 IsDeterministic]: Start isDeterministic. Operand 83 states and 205 transitions. [2025-04-26 18:40:21,631 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:21,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 205 transitions. [2025-04-26 18:40:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 205 transitions. [2025-04-26 18:40:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2025-04-26 18:40:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.5625) internal successors, (in total 164), 63 states have internal predecessors, (164), 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:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 164 transitions. [2025-04-26 18:40:21,650 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 18:40:21,650 INFO L438 stractBuchiCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 18:40:21,650 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:21,650 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 164 transitions. [2025-04-26 18:40:21,651 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 18:40:21,651 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:21,651 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:21,651 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:40:21,651 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:21,652 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_62)) (.cse1 (= v_name_1_15 v_name_2_15))) (and (= v_i_5_7 0) .cse0 (= (ite .cse1 0 v_result_4_19) v_result_4_18) (or (and (or .cse1 v_break_7_62) v_break_7_20) (and .cse0 (not .cse1) (not v_break_7_20))))) InVars {result_4=v_result_4_19, name_2=v_name_2_15, name_1=v_name_1_15} OutVars{name_2=v_name_2_15, i_5=v_i_5_7, result_4=v_result_4_18, break_7=v_break_7_20, name_1=v_name_1_15} AuxVars[v_break_7_62] AssignedVars[i_5, result_4, break_7]" "[133] L107-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L62: Formula: (let ((.cse0 (not v_break_11_52)) (.cse1 (= v_name_3_15 v_name_1_35))) (and (= v_i_9_11 0) .cse0 (= v_result_8_26 (ite .cse1 0 v_result_8_27)) (or (and (not v_break_11_22) (not .cse1) .cse0) (and (or .cse1 v_break_11_52) v_break_11_22)))) InVars {name_3=v_name_3_15, result_8=v_result_8_27, name_1=v_name_1_35} OutVars{name_3=v_name_3_15, result_8=v_result_8_26, break_11=v_break_11_22, name_1=v_name_1_35, i_9=v_i_9_11} AuxVars[v_break_11_52] AssignedVars[result_8, break_11, i_9]" [2025-04-26 18:40:21,652 INFO L754 eck$LassoCheckResult]: Loop: "[122] L62-->L62: Formula: (let ((.cse2 (not v_break_11_54)) (.cse3 (= v_name_3_25 v_current_10_16))) (let ((.cse0 (and .cse2 .cse3)) (.cse1 (= v_name_1_41 v_current_10_16)) (.cse4 (not v_break_11_43))) (and (= v_i_9_27 (+ v_i_9_28 1)) (= v_result_8_42 (ite .cse0 (- 1) (ite .cse1 1 v_result_8_44))) (< v_i_9_28 3) (or (and (or .cse0 v_break_11_54) v_break_11_42) (and (not v_break_11_42) .cse2 (or (not .cse3) v_break_11_54))) (= v_current_10_16 (select v_nondet_0_12 v_i_9_28)) (or (and (not .cse1) .cse2 .cse4) (and (or .cse1 v_break_11_43) v_break_11_54)) .cse4))) InVars {name_3=v_name_3_25, result_8=v_result_8_44, break_11=v_break_11_43, nondet_0=v_nondet_0_12, name_1=v_name_1_41, i_9=v_i_9_28} OutVars{name_3=v_name_3_25, result_8=v_result_8_42, break_11=v_break_11_42, current_10=v_current_10_16, name_1=v_name_1_41, nondet_0=v_nondet_0_12, i_9=v_i_9_27} AuxVars[v_break_11_54] AssignedVars[result_8, break_11, current_10, i_9]" [2025-04-26 18:40:21,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash 4912070, now seen corresponding path program 1 times [2025-04-26 18:40:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:21,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604243756] [2025-04-26 18:40:21,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:21,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:21,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:21,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:21,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:21,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:21,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:21,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:21,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash 153, now seen corresponding path program 1 times [2025-04-26 18:40:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:21,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723762009] [2025-04-26 18:40:21,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:21,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:21,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:21,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:21,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:21,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:21,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:21,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:21,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:21,671 INFO L85 PathProgramCache]: Analyzing trace with hash 152274292, now seen corresponding path program 1 times [2025-04-26 18:40:21,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:21,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181277756] [2025-04-26 18:40:21,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:21,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:21,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:21,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:21,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:21,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:21,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:21,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:22,019 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:22,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:22,019 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:22,019 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:22,019 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:22,019 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:22,019 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:22,019 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:22,019 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-subst.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:40:22,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:22,019 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:22,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:22,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:22,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:22,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:22,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:22,260 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 18:40:22,267 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 18:40:22,765 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:22,765 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:22,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:22,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:22,767 INFO L229 MonitoredProcess]: Starting monitored process 6 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:22,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:40:22,770 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:22,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:22,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:22,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:22,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:22,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:22,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:22,784 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:22,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:22,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:22,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:22,792 INFO L229 MonitoredProcess]: Starting monitored process 7 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:22,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:40:22,795 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:22,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:22,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:22,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:22,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:22,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:22,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:22,810 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:22,816 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:22,816 INFO L437 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:22,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:22,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:22,818 INFO L229 MonitoredProcess]: Starting monitored process 8 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:22,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:40:22,820 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:22,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:40:22,835 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:22,835 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:22,835 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_9) = -2*i_9 + 5 Supporting invariants [] [2025-04-26 18:40:22,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:22,840 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:22,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:22,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:22,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:22,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:22,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:22,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:22,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:22,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:22,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:22,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:22,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:22,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:22,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:22,870 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:22,870 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:22,870 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 164 transitions. cyclomatic complexity: 133 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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:22,904 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 164 transitions. cyclomatic complexity: 133. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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 177 states and 468 transitions. Complement of second has 4 states. [2025-04-26 18:40:22,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-26 18:40:22,905 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 18:40:22,905 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:22,905 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 18:40:22,905 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:22,905 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:40:22,905 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:22,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 468 transitions. [2025-04-26 18:40:22,908 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:22,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 91 states and 232 transitions. [2025-04-26 18:40:22,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-04-26 18:40:22,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 18:40:22,910 INFO L74 IsDeterministic]: Start isDeterministic. Operand 91 states and 232 transitions. [2025-04-26 18:40:22,910 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:22,910 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 232 transitions. [2025-04-26 18:40:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 232 transitions. [2025-04-26 18:40:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2025-04-26 18:40:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 2.675324675324675) internal successors, (in total 206), 76 states have internal predecessors, (206), 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:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 206 transitions. [2025-04-26 18:40:22,914 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 18:40:22,914 INFO L438 stractBuchiCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 18:40:22,914 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:22,914 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 206 transitions. [2025-04-26 18:40:22,915 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:22,915 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:22,915 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:22,915 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:22,915 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:22,916 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_62)) (.cse1 (= v_name_1_15 v_name_2_15))) (and (= v_i_5_7 0) .cse0 (= (ite .cse1 0 v_result_4_19) v_result_4_18) (or (and (or .cse1 v_break_7_62) v_break_7_20) (and .cse0 (not .cse1) (not v_break_7_20))))) InVars {result_4=v_result_4_19, name_2=v_name_2_15, name_1=v_name_1_15} OutVars{name_2=v_name_2_15, i_5=v_i_5_7, result_4=v_result_4_18, break_7=v_break_7_20, name_1=v_name_1_15} AuxVars[v_break_7_62] AssignedVars[i_5, result_4, break_7]" "[133] L107-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L62: Formula: (let ((.cse0 (not v_break_11_52)) (.cse1 (= v_name_3_15 v_name_1_35))) (and (= v_i_9_11 0) .cse0 (= v_result_8_26 (ite .cse1 0 v_result_8_27)) (or (and (not v_break_11_22) (not .cse1) .cse0) (and (or .cse1 v_break_11_52) v_break_11_22)))) InVars {name_3=v_name_3_15, result_8=v_result_8_27, name_1=v_name_1_35} OutVars{name_3=v_name_3_15, result_8=v_result_8_26, break_11=v_break_11_22, name_1=v_name_1_35, i_9=v_i_9_11} AuxVars[v_break_11_52] AssignedVars[result_8, break_11, i_9]" "[136] L108-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[124] $Ultimate##0-->L88: Formula: (let ((.cse0 (not v_break_15_62)) (.cse1 (= v_name_3_43 v_name_2_43))) (and .cse0 (= v_i_13_31 0) (= v_result_12_40 (ite .cse1 0 v_result_12_41)) (or (and (not .cse1) .cse0 (not v_break_15_52)) (and (or .cse1 v_break_15_62) v_break_15_52)))) InVars {name_3=v_name_3_43, result_12=v_result_12_41, name_2=v_name_2_43} OutVars{name_3=v_name_3_43, result_12=v_result_12_40, name_2=v_name_2_43, i_13=v_i_13_31, break_15=v_break_15_52} AuxVars[v_break_15_62] AssignedVars[result_12, i_13, break_15]" [2025-04-26 18:40:22,916 INFO L754 eck$LassoCheckResult]: Loop: "[125] L88-->L88: Formula: (let ((.cse3 (not v_break_15_64)) (.cse4 (= v_name_3_37 v_current_14_16))) (let ((.cse0 (and .cse3 .cse4)) (.cse1 (= v_name_2_37 v_current_14_16)) (.cse2 (not v_break_15_39))) (and (= v_result_12_28 (ite .cse0 (- 1) (ite .cse1 1 v_result_12_29))) (< v_i_13_28 3) .cse2 (or (and (not v_break_15_38) .cse3 (or (not .cse4) v_break_15_64)) (and (or v_break_15_64 .cse0) v_break_15_38)) (= (+ v_i_13_28 1) v_i_13_27) (= v_current_14_16 (select v_nondet_0_16 v_i_13_28)) (or (and (or .cse1 v_break_15_39) v_break_15_64) (and (not .cse1) .cse2 .cse3))))) InVars {name_3=v_name_3_37, result_12=v_result_12_29, name_2=v_name_2_37, i_13=v_i_13_28, nondet_0=v_nondet_0_16, break_15=v_break_15_39} OutVars{name_3=v_name_3_37, result_12=v_result_12_28, name_2=v_name_2_37, current_14=v_current_14_16, i_13=v_i_13_27, nondet_0=v_nondet_0_16, break_15=v_break_15_38} AuxVars[v_break_15_64] AssignedVars[result_12, current_14, i_13, break_15]" [2025-04-26 18:40:22,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash 425536314, now seen corresponding path program 1 times [2025-04-26 18:40:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:22,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411473408] [2025-04-26 18:40:22,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:22,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:22,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:22,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:22,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:22,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:22,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:22,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:22,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:22,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:22,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:22,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:22,931 INFO L85 PathProgramCache]: Analyzing trace with hash 156, now seen corresponding path program 1 times [2025-04-26 18:40:22,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:22,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063537392] [2025-04-26 18:40:22,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:22,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:22,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:22,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:22,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:22,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:22,934 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:22,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:22,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:22,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:22,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:22,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:22,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:22,937 INFO L85 PathProgramCache]: Analyzing trace with hash 306723971, now seen corresponding path program 1 times [2025-04-26 18:40:22,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:22,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108790652] [2025-04-26 18:40:22,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:22,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:22,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:22,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:22,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:22,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:22,945 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:22,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:22,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:22,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:22,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:22,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:23,323 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:23,323 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:23,324 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:23,324 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:23,324 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:23,324 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:23,324 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:23,324 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:23,324 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-subst.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:23,324 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:23,324 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:23,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,585 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2025-04-26 18:40:23,675 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 18:40:25,302 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:25,303 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:25,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:25,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:25,306 INFO L229 MonitoredProcess]: Starting monitored process 9 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:25,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:40:25,309 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:25,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:25,319 INFO L203 nArgumentSynthesizer]: 13 stem disjuncts [2025-04-26 18:40:25,319 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-04-26 18:40:25,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:25,492 INFO L402 nArgumentSynthesizer]: We have 294 Motzkin's Theorem applications. [2025-04-26 18:40:25,492 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-04-26 18:40:25,839 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:25,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:40:25,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:25,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:25,853 INFO L229 MonitoredProcess]: Starting monitored process 10 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:25,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:40:25,855 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:25,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:25,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:25,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:25,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:25,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:25,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:25,871 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:25,876 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:25,876 INFO L437 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:25,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:25,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:25,878 INFO L229 MonitoredProcess]: Starting monitored process 11 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:25,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:40:25,881 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:25,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:25,899 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:25,899 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:25,899 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 5 Supporting invariants [] [2025-04-26 18:40:25,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:40:25,907 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:25,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:25,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:25,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:25,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:25,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:25,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:25,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:25,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:25,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:25,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:25,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:25,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:25,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:25,945 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:25,946 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:25,946 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 206 transitions. cyclomatic complexity: 158 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 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:25,983 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 206 transitions. cyclomatic complexity: 158. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 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 148 states and 380 transitions. Complement of second has 4 states. [2025-04-26 18:40:25,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 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:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-04-26 18:40:25,985 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 1 letters. [2025-04-26 18:40:25,985 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:25,985 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 7 letters. Loop has 1 letters. [2025-04-26 18:40:25,985 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:25,985 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:40:25,985 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:25,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 380 transitions. [2025-04-26 18:40:25,987 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:25,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 0 states and 0 transitions. [2025-04-26 18:40:25,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:25,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:25,989 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:25,989 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:25,989 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:25,989 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:25,989 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:25,989 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:25,991 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:25,991 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:25,991 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:26,005 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:26,006 INFO L201 PluginConnector]: Adding new model name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:26 BoogieIcfgContainer [2025-04-26 18:40:26,006 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:26,007 INFO L158 Benchmark]: Toolchain (without parser) took 6818.90ms. Allocated memory was 159.4MB in the beginning and 176.2MB in the end (delta: 16.8MB). Free memory was 85.9MB in the beginning and 68.7MB in the end (delta: 17.1MB). Peak memory consumption was 32.3MB. Max. memory is 8.0GB. [2025-04-26 18:40:26,007 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:26,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.69ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 83.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:26,007 INFO L158 Benchmark]: Boogie Preprocessor took 23.64ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:26,007 INFO L158 Benchmark]: RCFGBuilder took 318.09ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 65.5MB in the end (delta: 17.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:40:26,008 INFO L158 Benchmark]: BuchiAutomizer took 6436.82ms. Allocated memory was 159.4MB in the beginning and 176.2MB in the end (delta: 16.8MB). Free memory was 65.3MB in the beginning and 68.7MB in the end (delta: -3.4MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2025-04-26 18:40:26,009 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.22ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.69ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 83.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.64ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 318.09ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 65.5MB in the end (delta: 17.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 6436.82ms. Allocated memory was 159.4MB in the beginning and 176.2MB in the end (delta: 16.8MB). Free memory was 65.3MB in the beginning and 68.7MB in the end (delta: -3.4MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 12 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax100 hnf100 lsp196 ukn50 mio100 lsp90 div100 bol111 ite100 ukn100 eq178 hnf99 smp100 dnf1503 smp19 tf100 neg100 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 535ms VariablesStem: 12 VariablesLoop: 8 DisjunctsStem: 13 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 294 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 204, Number of transitions in reduction automaton: 138, Number of states in reduction automaton: 66, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_5 + 5 and consists of 4 locations. One deterministic module has affine ranking function -2 * i_9 + 5 and consists of 3 locations. One deterministic module has affine ranking function 5 + -2 * i_13 and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:40:26,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...