/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 /storage/cav23-termute-examples/3_thr/indep_loops_minus1_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:57:00,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:57:00,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:57:00,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:57:00,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:57:00,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:57:00,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:57:00,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:57:00,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:57:00,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:57:00,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:57:00,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:57:00,694 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:57:00,694 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:57:00,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:57:00,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:57:00,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:57:00,696 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:57:00,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:57:00,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:57:00,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:57:00,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:00,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:57:00,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:57:00,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:57:00,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:57:00,696 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:57:00,697 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:57:00,697 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:57:00,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:57:00,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:57:00,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:57:00,940 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:57:00,941 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:57:00,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/indep_loops_minus1_3.c.bpl [2025-04-26 16:57:00,942 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/indep_loops_minus1_3.c.bpl' [2025-04-26 16:57:00,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:57:00,962 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:57:00,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:00,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:57:00,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:57:00,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:00,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:00,998 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:57:00,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:01,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:57:01,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:57:01,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:57:01,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:01,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:01,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:01,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:01,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:01,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:01,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:01,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:01,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:01,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:57:01,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:57:01,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:57:01,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:57:01,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/1) ... [2025-04-26 16:57:01,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:01,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,047 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:57:01,053 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:57:01,076 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:57:01,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:57:01,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:57:01,076 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:57:01,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:57:01,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:57:01,077 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:57:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:57:01,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:57:01,077 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:57:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:57:01,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:57:01,077 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:57:01,110 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:57:01,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:57:01,170 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:57:01,171 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:57:01,180 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:57:01,181 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:57:01,182 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:01 BoogieIcfgContainer [2025-04-26 16:57:01,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:57:01,183 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:57:01,183 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:57:01,187 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:57:01,187 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:01,187 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:00" (1/2) ... [2025-04-26 16:57:01,189 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ce0900 and model type indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:57:01, skipping insertion in model container [2025-04-26 16:57:01,189 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:01,189 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:01" (2/2) ... [2025-04-26 16:57:01,190 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_3.c.bpl [2025-04-26 16:57:01,240 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:57:01,278 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:57:01,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:57:01,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,283 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:57:01,285 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:57:01,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 73 flow [2025-04-26 16:57:01,359 INFO L116 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-04-26 16:57:01,360 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:57:01,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 3/20 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-26 16:57:01,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 26 transitions, 73 flow [2025-04-26 16:57:01,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 20 transitions, 58 flow [2025-04-26 16:57:01,370 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 27 places, 20 transitions, 58 flow [2025-04-26 16:57:01,375 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:57:01,513 WARN L140 AmpleReduction]: Number of pruned transitions: 112 [2025-04-26 16:57:01,514 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:57:01,514 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 30 [2025-04-26 16:57:01,514 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:19 [2025-04-26 16:57:01,514 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:65 [2025-04-26 16:57:01,514 WARN L145 AmpleReduction]: Times succ was already a loop node:35 [2025-04-26 16:57:01,514 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:17 [2025-04-26 16:57:01,514 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:57:01,518 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 115 states, 114 states have (on average 1.7982456140350878) internal successors, (in total 205), 114 states have internal predecessors, (205), 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:57:01,526 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:57:01,526 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:57:01,526 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:57:01,526 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:57:01,526 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:57:01,527 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:57:01,527 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:57:01,527 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:57:01,529 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 115 states, 114 states have (on average 1.7982456140350878) internal successors, (in total 205), 114 states have internal predecessors, (205), 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:57:01,551 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 91 [2025-04-26 16:57:01,551 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:01,552 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:01,555 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:57:01,555 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:01,555 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:57:01,556 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 115 states, 114 states have (on average 1.7982456140350878) internal successors, (in total 205), 114 states have internal predecessors, (205), 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:57:01,560 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 91 [2025-04-26 16:57:01,560 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:01,560 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:01,560 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:57:01,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:01,565 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:57:01,565 INFO L754 eck$LassoCheckResult]: Loop: "[50] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[52] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:57:01,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:01,573 INFO L85 PathProgramCache]: Analyzing trace with hash 95, now seen corresponding path program 1 times [2025-04-26 16:57:01,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:01,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234584822] [2025-04-26 16:57:01,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:01,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:01,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:01,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:01,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:01,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:01,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:01,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:01,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2025-04-26 16:57:01,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:01,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644094614] [2025-04-26 16:57:01,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:01,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:01,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:01,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,680 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:01,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:01,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:01,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:01,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:01,690 INFO L85 PathProgramCache]: Analyzing trace with hash 92897, now seen corresponding path program 1 times [2025-04-26 16:57:01,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:01,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257332774] [2025-04-26 16:57:01,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:01,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:01,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:01,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:01,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:01,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:01,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:01,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:01,741 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:01,742 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:01,742 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:01,742 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:01,742 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:01,742 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,742 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:01,742 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:01,742 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:01,742 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:01,743 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:01,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:01,783 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:01,798 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:01,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,802 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:57:01,803 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:57:01,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:01,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:01,832 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:57:01,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,835 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:57:01,838 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:57:01,839 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:01,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:01,937 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:01,944 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:57:01,944 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:01,944 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:01,945 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:01,945 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:01,945 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:01,945 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,945 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:01,945 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:01,945 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:01,945 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:01,945 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:01,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:01,975 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:01,978 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:01,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,982 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:57:01,985 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:57:01,986 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:57:01,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:01,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:01,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:01,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:01,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:02,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:02,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:02,008 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:02,016 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:02,017 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:02,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,020 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:57:02,022 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:57:02,023 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:02,026 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:57:02,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:57:02,028 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:02,028 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:02,028 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:57:02,034 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 16:57:02,037 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:02,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:02,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:02,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:02,099 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:02,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:02,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:02,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:02,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:02,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:02,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:02,129 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:57:02,176 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:02,181 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 115 states, 114 states have (on average 1.7982456140350878) internal successors, (in total 205), 114 states have internal predecessors, (205), 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 3 states, 3 states have (on average 1.0) 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:57:02,291 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 115 states, 114 states have (on average 1.7982456140350878) internal successors, (in total 205), 114 states have internal predecessors, (205), 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 3 states, 3 states have (on average 1.0) 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 265 states and 488 transitions. Complement of second has 6 states. [2025-04-26 16:57:02,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) 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:57:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2025-04-26 16:57:02,300 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:57:02,301 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:02,301 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:57:02,301 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:02,301 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:57:02,301 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:02,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 488 transitions. [2025-04-26 16:57:02,313 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 66 [2025-04-26 16:57:02,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 125 states and 226 transitions. [2025-04-26 16:57:02,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2025-04-26 16:57:02,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2025-04-26 16:57:02,318 INFO L74 IsDeterministic]: Start isDeterministic. Operand 125 states and 226 transitions. [2025-04-26 16:57:02,318 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:02,319 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 226 transitions. [2025-04-26 16:57:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 226 transitions. [2025-04-26 16:57:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2025-04-26 16:57:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 112 states have (on average 1.8303571428571428) internal successors, (in total 205), 111 states have internal predecessors, (205), 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:57:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 205 transitions. [2025-04-26 16:57:02,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 112 states and 205 transitions. [2025-04-26 16:57:02,340 INFO L438 stractBuchiCegarLoop]: Abstraction has 112 states and 205 transitions. [2025-04-26 16:57:02,340 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:57:02,341 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 205 transitions. [2025-04-26 16:57:02,342 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 66 [2025-04-26 16:57:02,342 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:02,342 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:02,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:57:02,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:57:02,342 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L12-->L32: 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]" [2025-04-26 16:57:02,346 INFO L754 eck$LassoCheckResult]: Loop: "[54] L32-->L34: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[56] L34-->L35: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[57] L35-->L32: Formula: (= v_x1_5 (+ v_x1_6 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 16:57:02,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash 3012, now seen corresponding path program 1 times [2025-04-26 16:57:02,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:02,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313362580] [2025-04-26 16:57:02,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:02,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:02,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:02,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,350 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:02,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:02,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:02,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:02,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash 83478, now seen corresponding path program 1 times [2025-04-26 16:57:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:02,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366042335] [2025-04-26 16:57:02,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:02,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:02,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:02,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:02,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:02,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:02,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:02,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,362 INFO L85 PathProgramCache]: Analyzing trace with hash 89784179, now seen corresponding path program 1 times [2025-04-26 16:57:02,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:02,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565935802] [2025-04-26 16:57:02,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:02,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:02,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:02,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:02,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,370 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:02,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:02,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:02,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:02,399 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:02,399 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:02,399 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:02,399 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:02,399 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:02,399 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,399 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:02,399 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:02,399 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:02,399 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:02,399 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:02,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:02,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:02,437 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:02,437 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:02,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,439 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:57:02,440 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:57:02,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:02,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:02,458 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:57:02,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,461 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:57:02,462 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:57:02,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:02,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:02,488 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:57:02,489 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0} Honda state: {x1=0} Generalized eigenvectors: [{x1=7}, {x1=2}, {x1=-8}] Lambdas: [1, 5, 1] Nus: [0, 1] [2025-04-26 16:57:02,494 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:57:02,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,496 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:57:02,497 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:57:02,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:02,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:02,514 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 16:57:02,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,517 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:57:02,518 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:57:02,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:02,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:02,590 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:02,594 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:57:02,595 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:02,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:02,595 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:02,595 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:02,595 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:02,595 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,595 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:02,595 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:02,595 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:02,595 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:02,595 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:02,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:02,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:02,624 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:02,624 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:02,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,626 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:57:02,628 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:57:02,629 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:57:02,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:02,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:02,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:02,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:02,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:02,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:02,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:02,642 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:57:02,648 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 16:57:02,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,652 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:57:02,653 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:57:02,656 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:57:02,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:02,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:02,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:02,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:02,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:02,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:02,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:02,669 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:02,671 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:02,671 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:02,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,673 INFO L229 MonitoredProcess]: Starting monitored process 13 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:57:02,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:57:02,675 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:02,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:57:02,678 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:02,679 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:02,679 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:57:02,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:02,685 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:02,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:02,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:02,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:02,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:02,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:02,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:02,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:02,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:02,722 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:02,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:02,768 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:57:02,768 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:57:02,768 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 205 transitions. cyclomatic complexity: 122 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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:57:02,821 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 205 transitions. cyclomatic complexity: 122. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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 266 states and 496 transitions. Complement of second has 6 states. [2025-04-26 16:57:02,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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:57:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-26 16:57:02,822 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:57:02,823 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:02,823 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:57:02,823 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:02,823 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:57:02,823 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:02,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 496 transitions. [2025-04-26 16:57:02,826 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2025-04-26 16:57:02,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 142 states and 267 transitions. [2025-04-26 16:57:02,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2025-04-26 16:57:02,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-04-26 16:57:02,831 INFO L74 IsDeterministic]: Start isDeterministic. Operand 142 states and 267 transitions. [2025-04-26 16:57:02,831 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:02,831 INFO L218 hiAutomatonCegarLoop]: Abstraction has 142 states and 267 transitions. [2025-04-26 16:57:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 267 transitions. [2025-04-26 16:57:02,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 126. [2025-04-26 16:57:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.9444444444444444) internal successors, (in total 245), 125 states have internal predecessors, (245), 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:57:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 245 transitions. [2025-04-26 16:57:02,835 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 245 transitions. [2025-04-26 16:57:02,835 INFO L438 stractBuchiCegarLoop]: Abstraction has 126 states and 245 transitions. [2025-04-26 16:57:02,835 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:57:02,835 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 245 transitions. [2025-04-26 16:57:02,836 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2025-04-26 16:57:02,836 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:02,837 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:02,837 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:57:02,837 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:02,837 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L12-->L32: 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]" "[54] L32-->L34: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[56] L34-->L35: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[70] L13-->L42: 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]" [2025-04-26 16:57:02,837 INFO L754 eck$LassoCheckResult]: Loop: "[59] L42-->L44: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[61] L44-->L42: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:57:02,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash 89784192, now seen corresponding path program 1 times [2025-04-26 16:57:02,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:02,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14626852] [2025-04-26 16:57:02,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:02,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:02,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:02,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:02,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:02,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:02,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:02,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:02,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2025-04-26 16:57:02,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:02,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87271030] [2025-04-26 16:57:02,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:02,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:02,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:02,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:02,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:02,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:02,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:02,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,852 INFO L85 PathProgramCache]: Analyzing trace with hash 383264482, now seen corresponding path program 1 times [2025-04-26 16:57:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:02,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252228165] [2025-04-26 16:57:02,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:02,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:02,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:02,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:02,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:02,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:02,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:02,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:02,882 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:02,882 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:02,882 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:02,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:02,882 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:02,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:02,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:02,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:02,882 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:02,882 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:02,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:02,902 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:02,902 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:02,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,908 INFO L229 MonitoredProcess]: Starting monitored process 14 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:57:02,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:57:02,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:02,910 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:02,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:57:02,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,930 INFO L229 MonitoredProcess]: Starting monitored process 15 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:57:02,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:57:02,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:02,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:02,999 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:03,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:57:03,003 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,003 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,003 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,003 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,004 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:03,004 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,004 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,004 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,004 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:03,004 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,004 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,020 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,020 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:03,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,022 INFO L229 MonitoredProcess]: Starting monitored process 16 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:57:03,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:57:03,024 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:57:03,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:03,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:03,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:03,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:03,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:03,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:03,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:03,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:03,040 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:03,040 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:03,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,042 INFO L229 MonitoredProcess]: Starting monitored process 17 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:57:03,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:57:03,044 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:03,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:57:03,048 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:03,048 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:03,048 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:57:03,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:03,056 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:03,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:03,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:03,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,094 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:57:03,095 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:03,095 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 126 states and 245 transitions. cyclomatic complexity: 143 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 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 16:57:03,135 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 126 states and 245 transitions. cyclomatic complexity: 143. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 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 273 states and 519 transitions. Complement of second has 6 states. [2025-04-26 16:57:03,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 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 16:57:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-26 16:57:03,136 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:57:03,137 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,137 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:57:03,137 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,137 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:57:03,137 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 519 transitions. [2025-04-26 16:57:03,140 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:03,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 0 states and 0 transitions. [2025-04-26 16:57:03,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:57:03,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:57:03,140 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:57:03,140 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:57:03,140 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:03,140 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:03,140 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:03,140 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:57:03,140 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:57:03,140 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:03,140 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:57:03,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:57:03,155 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:57:03 BoogieIcfgContainer [2025-04-26 16:57:03,155 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:57:03,156 INFO L158 Benchmark]: Toolchain (without parser) took 2193.35ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 84.4MB in the beginning and 48.7MB in the end (delta: 35.8MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. [2025-04-26 16:57:03,156 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:03,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.76ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 82.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:03,156 INFO L158 Benchmark]: Boogie Preprocessor took 22.29ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 81.5MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:57:03,156 INFO L158 Benchmark]: RCFGBuilder took 158.03ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 72.9MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:57:03,157 INFO L158 Benchmark]: BuchiAutomizer took 1972.59ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 72.9MB in the beginning and 48.7MB in the end (delta: 24.2MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2025-04-26 16:57:03,158 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.17ms. Allocated memory is still 159.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.76ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 82.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.29ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 81.5MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 158.03ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 72.9MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1972.59ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 72.9MB in the beginning and 48.7MB in the end (delta: 24.2MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 29 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, 81 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 36 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 49ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 240, Number of transitions in reduction automaton: 205, Number of states in reduction automaton: 115, 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 -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:57:03,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...