/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/nzb-file-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:51,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:51,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:51,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:51,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:51,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:51,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:51,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:51,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:51,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:51,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:51,165 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:51,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:51,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:51,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:51,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:51,166 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:51,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:51,166 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:51,166 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:51,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:51,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:51,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:51,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:51,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:51,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:51,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:51,167 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:51,167 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:51,167 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:51,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:51,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:51,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:51,397 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:51,398 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:51,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-symm.wvr.bpl [2025-04-26 16:54:51,400 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-symm.wvr.bpl' [2025-04-26 16:54:51,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:51,422 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:51,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:51,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:51,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:51,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,457 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:51,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:51,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:51,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:51,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:51,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:51,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:51,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:51,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:51,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:51,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:51,504 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 16:54:51,508 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 16:54:51,527 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:51,527 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:51,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:51,527 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:51,527 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:51,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:51,527 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:51,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:51,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:51,528 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 16:54:51,569 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:51,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:51,688 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:51,689 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:51,745 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:51,746 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 16:54:51,746 INFO L201 PluginConnector]: Adding new model nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:51 BoogieIcfgContainer [2025-04-26 16:54:51,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:51,749 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:51,749 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:51,754 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:51,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:51,754 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/2) ... [2025-04-26 16:54:51,755 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62fea2fd and model type nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:51, skipping insertion in model container [2025-04-26 16:54:51,755 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:51,755 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:51" (2/2) ... [2025-04-26 16:54:51,756 INFO L376 chiAutomizerObserver]: Analyzing ICFG nzb-file-symm.wvr.bpl [2025-04-26 16:54:51,798 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:54:51,831 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:51,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:51,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:51,835 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 16:54:51,836 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 16:54:51,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 58 flow [2025-04-26 16:54:51,901 INFO L116 PetriNetUnfolderBase]: 4/18 cut-off events. [2025-04-26 16:54:51,905 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:54:51,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 4/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 17 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-26 16:54:51,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 58 flow [2025-04-26 16:54:51,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 18 transitions, 48 flow [2025-04-26 16:54:51,911 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 21 places, 18 transitions, 48 flow [2025-04-26 16:54:51,918 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:51,950 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 46#[thread1EXIT, L68, L96]true [2025-04-26 16:54:51,951 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 30#[L34, L95]true [2025-04-26 16:54:51,954 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 68#[L68, L34, L96]true [2025-04-26 16:54:51,955 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 70#[L85, L34, L96]true [2025-04-26 16:54:51,955 WARN L140 AmpleReduction]: Number of pruned transitions: 9 [2025-04-26 16:54:51,955 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 4 [2025-04-26 16:54:51,955 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 4 [2025-04-26 16:54:51,956 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:12 [2025-04-26 16:54:51,956 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:11 [2025-04-26 16:54:51,956 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:54:51,956 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:54:51,956 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:51,957 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (in total 37), 23 states have internal predecessors, (37), 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 16:54:51,982 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:51,982 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:51,982 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:51,982 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:51,982 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:51,984 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:51,984 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:51,984 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:51,985 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (in total 37), 23 states have internal predecessors, (37), 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 16:54:51,994 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2025-04-26 16:54:51,995 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:51,995 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:51,998 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:51,998 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:51,998 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:51,999 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (in total 37), 23 states have internal predecessors, (37), 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 16:54:52,001 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2025-04-26 16:54:52,001 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:52,001 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:52,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:52,001 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:52,005 INFO L752 eck$LassoCheckResult]: Stem: "[108] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[96] $Ultimate##0-->L34: Formula: (and (not v_break_10_15) (not v_is_null_5_7) (= v_i_9_14 0) (not v_is_null_1_7)) InVars {is_null_1=v_is_null_1_7, is_null_5=v_is_null_5_7} OutVars{break_10=v_break_10_15, is_null_5=v_is_null_5_7, is_null_1=v_is_null_1_7, i_9=v_i_9_14} AuxVars[] AssignedVars[break_10, i_9]" [2025-04-26 16:54:52,006 INFO L754 eck$LassoCheckResult]: Loop: "[99] L34-->L34: Formula: (let ((.cse3 (not v_break_10_67)) (.cse7 (not v_break_10_68)) (.cse9 (select v_ends_with_6_21 v_i_9_43)) (.cse8 (select v_ends_with_2_17 v_i_9_43))) (let ((.cse0 (and .cse9 .cse8)) (.cse4 (not v_break_10_56)) (.cse5 (and .cse7 .cse9)) (.cse2 (not .cse9)) (.cse6 (and .cse3 .cse8)) (.cse1 (not .cse8))) (and (or (and (or v_break_10_56 .cse0) v_break_10_67) (and (or .cse1 .cse2) .cse3 .cse4)) (= v_i_9_42 (+ v_i_9_43 1)) (= v_result_8_41 (ite .cse5 (+ 1000 v_i_9_43) (ite .cse6 (+ v_i_9_43 (- 1000)) (ite .cse0 0 v_result_8_42)))) .cse4 (or (and (or v_break_10_68 .cse5) v_break_10_55) (and .cse7 (or .cse2 v_break_10_68) (not v_break_10_55))) (or (and v_break_10_68 (or .cse6 v_break_10_67)) (and .cse7 .cse3 (or .cse1 v_break_10_67))) (< v_i_9_43 5)))) InVars {result_8=v_result_8_42, break_10=v_break_10_56, ends_with_6=v_ends_with_6_21, i_9=v_i_9_43, ends_with_2=v_ends_with_2_17} OutVars{result_8=v_result_8_41, break_10=v_break_10_55, ends_with_6=v_ends_with_6_21, i_9=v_i_9_42, ends_with_2=v_ends_with_2_17} AuxVars[v_break_10_68, v_break_10_67] AssignedVars[result_8, break_10, i_9]" [2025-04-26 16:54:52,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash 4405, now seen corresponding path program 1 times [2025-04-26 16:54:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:52,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184007892] [2025-04-26 16:54:52,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:52,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:52,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:52,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,055 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:52,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:52,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:52,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:52,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2025-04-26 16:54:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:52,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176108571] [2025-04-26 16:54:52,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:52,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:52,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:52,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:52,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:52,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:52,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:52,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:52,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 136654, now seen corresponding path program 1 times [2025-04-26 16:54:52,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:52,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658097018] [2025-04-26 16:54:52,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:52,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:52,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:52,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:52,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:52,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:52,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:52,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:52,722 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:52,723 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:52,723 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:52,723 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:52,723 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:52,724 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:52,724 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:52,724 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:52,724 INFO L132 ssoRankerPreferences]: Filename of dumped script: nzb-file-symm.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:52,724 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:52,724 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:52,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:52,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:52,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:52,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:52,964 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:54:53,132 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:53,135 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:53,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:53,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:53,138 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 16:54:53,140 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 16:54:53,140 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 16:54:53,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:53,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:53,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:53,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:53,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:53,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:53,159 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:53,165 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 16:54:53,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:53,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:53,167 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 16:54:53,168 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 16:54:53,170 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 16:54:53,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:53,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:53,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:53,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:53,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:53,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:53,185 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:53,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:53,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:53,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:53,192 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 16:54:53,194 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 16:54:53,195 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 16:54:53,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:53,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:53,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:53,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:53,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:53,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:53,213 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:53,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:53,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:53,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:53,221 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 16:54:53,222 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 16:54:53,224 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 16:54:53,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:53,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:53,234 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:54:53,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:53,278 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:54:53,278 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:54:53,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:53,388 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:54:53,388 INFO L437 ModelExtractionUtils]: 45 out of 55 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:54:53,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:53,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:53,414 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 16:54:53,415 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 16:54:53,416 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:53,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:54:53,439 INFO L439 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-04-26 16:54:53,440 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:53,440 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_9) = -2*i_9 + 9 Supporting invariants [] [2025-04-26 16:54:53,448 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 16:54:53,450 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:53,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:53,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:53,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:53,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:53,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:53,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:53,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:53,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:53,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:53,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:53,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:53,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:53,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:53,490 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 16:54:53,504 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 16:54:53,506 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (in total 37), 23 states have internal predecessors, (37), 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 16:54:53,557 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (in total 37), 23 states have internal predecessors, (37), 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 66 states and 111 transitions. Complement of second has 5 states. [2025-04-26 16:54:53,562 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 16:54:53,565 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 16:54:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2025-04-26 16:54:53,571 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:54:53,572 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:53,572 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:54:53,572 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:53,572 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:54:53,572 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:53,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 111 transitions. [2025-04-26 16:54:53,578 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-04-26 16:54:53,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 22 states and 37 transitions. [2025-04-26 16:54:53,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-04-26 16:54:53,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-04-26 16:54:53,582 INFO L74 IsDeterministic]: Start isDeterministic. Operand 22 states and 37 transitions. [2025-04-26 16:54:53,582 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:53,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 37 transitions. [2025-04-26 16:54:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 37 transitions. [2025-04-26 16:54:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2025-04-26 16:54:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (in total 28), 14 states have internal predecessors, (28), 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 16:54:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2025-04-26 16:54:53,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 28 transitions. [2025-04-26 16:54:53,600 INFO L438 stractBuchiCegarLoop]: Abstraction has 15 states and 28 transitions. [2025-04-26 16:54:53,600 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:53,602 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 28 transitions. [2025-04-26 16:54:53,604 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 16:54:53,604 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:53,604 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:53,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:54:53,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:53,605 INFO L752 eck$LassoCheckResult]: Stem: "[108] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[96] $Ultimate##0-->L34: Formula: (and (not v_break_10_15) (not v_is_null_5_7) (= v_i_9_14 0) (not v_is_null_1_7)) InVars {is_null_1=v_is_null_1_7, is_null_5=v_is_null_5_7} OutVars{break_10=v_break_10_15, is_null_5=v_is_null_5_7, is_null_1=v_is_null_1_7, i_9=v_i_9_14} AuxVars[] AssignedVars[break_10, i_9]" "[111] L95-->$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]" "[101] $Ultimate##0-->L68: Formula: (and (= v_i_12_14 0) (not v_is_null_5_11) (not v_is_null_1_11) (not v_break_13_15)) InVars {is_null_1=v_is_null_1_11, is_null_5=v_is_null_5_11} OutVars{i_12=v_i_12_14, is_null_5=v_is_null_5_11, break_13=v_break_13_15, is_null_1=v_is_null_1_11} AuxVars[] AssignedVars[i_12, break_13]" [2025-04-26 16:54:53,605 INFO L754 eck$LassoCheckResult]: Loop: "[104] L68-->L68: Formula: (let ((.cse9 (select v_ends_with_6_31 v_i_12_43)) (.cse7 (not v_break_13_68)) (.cse8 (select v_ends_with_2_31 v_i_12_43)) (.cse1 (not v_break_13_67))) (let ((.cse2 (and .cse8 .cse1)) (.cse3 (and .cse9 .cse7)) (.cse4 (and .cse9 .cse8)) (.cse5 (not v_break_13_56)) (.cse6 (not .cse9)) (.cse0 (not .cse8))) (and (= (+ v_i_12_43 1) v_i_12_42) (or (and (or .cse0 v_break_13_67) .cse1 (not v_break_13_55)) (and v_break_13_55 (or v_break_13_67 .cse2))) (= (ite .cse2 (+ 1000 v_i_12_43) (ite .cse3 (+ v_i_12_43 (- 1000)) (ite .cse4 0 v_result_11_42))) v_result_11_41) .cse5 (or (and (or v_break_13_68 .cse3) v_break_13_67) (and .cse1 (or .cse6 v_break_13_68) .cse7)) (or (and v_break_13_68 (or .cse4 v_break_13_56)) (and .cse5 .cse7 (or .cse6 .cse0))) (< v_i_12_43 5)))) InVars {result_11=v_result_11_42, i_12=v_i_12_43, ends_with_6=v_ends_with_6_31, break_13=v_break_13_56, ends_with_2=v_ends_with_2_31} OutVars{result_11=v_result_11_41, i_12=v_i_12_42, ends_with_6=v_ends_with_6_31, break_13=v_break_13_55, ends_with_2=v_ends_with_2_31} AuxVars[v_break_13_68, v_break_13_67] AssignedVars[result_11, i_12, break_13]" [2025-04-26 16:54:53,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:53,606 INFO L85 PathProgramCache]: Analyzing trace with hash 4236747, now seen corresponding path program 1 times [2025-04-26 16:54:53,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:53,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807561430] [2025-04-26 16:54:53,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:53,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:53,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:53,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:53,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:53,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:53,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:53,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:53,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:53,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:53,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:53,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:53,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:53,631 INFO L85 PathProgramCache]: Analyzing trace with hash 135, now seen corresponding path program 1 times [2025-04-26 16:54:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:53,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630977801] [2025-04-26 16:54:53,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:53,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:53,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:53,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:53,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:53,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:53,641 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:53,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:53,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:53,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:53,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:53,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:53,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash 131339261, now seen corresponding path program 1 times [2025-04-26 16:54:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:53,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216233657] [2025-04-26 16:54:53,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:53,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:53,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:53,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:53,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:53,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:53,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:53,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:53,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:53,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:53,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:53,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:53,976 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:53,976 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:53,976 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:53,976 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:53,976 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:53,976 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:53,976 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:53,976 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:53,976 INFO L132 ssoRankerPreferences]: Filename of dumped script: nzb-file-symm.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:54:53,976 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:53,976 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:53,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:53,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:53,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:53,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,145 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:54:54,311 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:54,312 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:54,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:54,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:54,314 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 16:54:54,316 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 16:54:54,317 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 16:54:54,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:54,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:54,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:54,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:54,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:54,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:54,333 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:54,338 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 16:54:54,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:54,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:54,342 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 16:54:54,344 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 16:54:54,344 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 16:54:54,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:54,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:54,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:54,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:54,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:54,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:54,359 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:54,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:54,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:54,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:54,367 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 16:54:54,371 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 16:54:54,372 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 16:54:54,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:54,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:54,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:54,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:54,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:54,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:54,385 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:54,391 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 16:54:54,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:54,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:54,394 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 16:54:54,395 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 16:54:54,397 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 16:54:54,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:54,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:54,408 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:54:54,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:54,445 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:54:54,445 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:54:54,501 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:54,547 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:54:54,548 INFO L437 ModelExtractionUtils]: 44 out of 55 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 16:54:54,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:54,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:54,550 INFO L229 MonitoredProcess]: Starting monitored process 12 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 16:54:54,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:54:54,553 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:54,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:54:54,575 INFO L439 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-04-26 16:54:54,575 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:54,575 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_12) = -2*i_12 + 9 Supporting invariants [] [2025-04-26 16:54:54,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:54:54,583 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:54,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:54,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:54,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:54,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:54,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:54,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:54,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:54,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:54,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:54,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:54,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:54,614 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 16:54:54,614 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 16:54:54,614 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 28 transitions. cyclomatic complexity: 18 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 16:54:54,636 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 28 transitions. cyclomatic complexity: 18. 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 26 states and 46 transitions. Complement of second has 4 states. [2025-04-26 16:54:54,636 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 16:54:54,637 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 16:54:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-04-26 16:54:54,637 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:54:54,637 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:54,637 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:54:54,637 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:54,637 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:54:54,637 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:54,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 46 transitions. [2025-04-26 16:54:54,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:54,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2025-04-26 16:54:54,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:54,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:54,638 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:54,638 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:54,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:54,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:54,638 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:54,638 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:54,638 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:54,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:54,638 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:54,652 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 16:54:54,654 INFO L201 PluginConnector]: Adding new model nzb-file-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:54 BoogieIcfgContainer [2025-04-26 16:54:54,655 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:54,656 INFO L158 Benchmark]: Toolchain (without parser) took 3234.10ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 84.3MB in the beginning and 70.2MB in the end (delta: 14.1MB). Peak memory consumption was 2.0MB. Max. memory is 8.0GB. [2025-04-26 16:54:54,656 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.72ms. Allocated memory is still 155.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:54,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.03ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 82.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:54,657 INFO L158 Benchmark]: Boogie Preprocessor took 23.20ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 81.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:54,657 INFO L158 Benchmark]: RCFGBuilder took 263.41ms. Allocated memory is still 155.2MB. Free memory was 81.3MB in the beginning and 65.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 16:54:54,657 INFO L158 Benchmark]: BuchiAutomizer took 2906.86ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 65.4MB in the beginning and 70.2MB in the end (delta: -4.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:54,660 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.72ms. Allocated memory is still 155.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.03ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 82.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.20ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 81.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 263.41ms. Allocated memory is still 155.2MB. Free memory was 81.3MB in the beginning and 65.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 2906.86ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 65.4MB in the beginning and 70.2MB in the end (delta: -4.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 10 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital93 mio100 ax100 hnf100 lsp287 ukn26 mio100 lsp100 div100 bol136 ite100 ukn100 eq140 hnf98 smp100 dnf421 smp27 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 220ms VariablesStem: 2 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 130, Number of transitions in reduction automaton: 37, Number of states in reduction automaton: 24, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_9 + 9 and consists of 4 locations. One deterministic module has affine ranking function 9 + -2 * i_12 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 16:54:54,675 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...