./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDown.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/UpAndDown.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1a3ce217426a55eb46107f2cdf23c10dcc5d92a99768880786a980fae67c3971 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:21:03,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:21:03,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:21:03,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:21:03,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:21:03,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:21:03,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:21:03,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:21:03,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:21:03,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:21:03,932 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:21:03,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:21:03,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:21:03,933 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:21:03,933 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:21:03,933 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:21:03,933 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:21:03,933 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:21:03,933 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:21:03,933 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:21:03,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:21:03,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:21:03,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:21:03,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:21:03,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:21:03,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:21:03,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:21:03,934 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:21:03,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:21:03,934 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:21:03,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:21:03,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:21:03,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:21:03,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:21:03,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:21:03,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:21:03,935 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:21:03,935 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a3ce217426a55eb46107f2cdf23c10dcc5d92a99768880786a980fae67c3971 [2025-02-08 14:21:04,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:21:04,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:21:04,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:21:04,135 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:21:04,135 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:21:04,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2025-02-08 14:21:05,241 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a04cf1a3/3c99580ed2ae4282984afa90f796fc57/FLAGb685a3a18 [2025-02-08 14:21:05,503 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:21:05,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2025-02-08 14:21:05,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a04cf1a3/3c99580ed2ae4282984afa90f796fc57/FLAGb685a3a18 [2025-02-08 14:21:05,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a04cf1a3/3c99580ed2ae4282984afa90f796fc57 [2025-02-08 14:21:05,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:21:05,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:21:05,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:21:05,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:21:05,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:21:05,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bce78fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05, skipping insertion in model container [2025-02-08 14:21:05,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:21:05,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:21:05,763 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:21:05,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:21:05,794 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:21:05,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05 WrapperNode [2025-02-08 14:21:05,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:21:05,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:21:05,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:21:05,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:21:05,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,831 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-02-08 14:21:05,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:21:05,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:21:05,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:21:05,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:21:05,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,849 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 14:21:05,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:21:05,860 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:21:05,863 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:21:05,863 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:21:05,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (1/1) ... [2025-02-08 14:21:05,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:05,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:05,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:05,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:21:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:21:05,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:21:05,962 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:21:05,964 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:21:06,012 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-02-08 14:21:06,014 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:21:06,019 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:21:06,020 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:21:06,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:21:06 BoogieIcfgContainer [2025-02-08 14:21:06,021 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:21:06,022 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:21:06,022 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:21:06,026 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:21:06,026 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:21:06,026 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:21:05" (1/3) ... [2025-02-08 14:21:06,028 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e9ba6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:21:06, skipping insertion in model container [2025-02-08 14:21:06,028 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:21:06,028 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:05" (2/3) ... [2025-02-08 14:21:06,029 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e9ba6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:21:06, skipping insertion in model container [2025-02-08 14:21:06,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:21:06,029 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:21:06" (3/3) ... [2025-02-08 14:21:06,030 INFO L363 chiAutomizerObserver]: Analyzing ICFG UpAndDown.c [2025-02-08 14:21:06,070 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:21:06,070 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:21:06,070 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:21:06,070 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:21:06,070 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:21:06,070 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:21:06,070 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:21:06,071 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:21:06,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:06,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:21:06,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:06,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:06,086 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:21:06,086 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:06,087 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:21:06,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:06,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:21:06,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:06,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:06,088 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:21:06,088 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:06,092 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:06,093 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:21:06,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 1 times [2025-02-08 14:21:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:06,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727106152] [2025-02-08 14:21:06,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:06,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:06,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:21:06,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:21:06,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:06,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:06,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:06,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:21:06,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:21:06,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:06,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:06,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:06,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1136957, now seen corresponding path program 1 times [2025-02-08 14:21:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:06,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106292353] [2025-02-08 14:21:06,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:06,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:06,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:06,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:06,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:06,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:06,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106292353] [2025-02-08 14:21:06,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106292353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:06,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:21:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246299721] [2025-02-08 14:21:06,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:06,259 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:21:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:06,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:21:06,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:21:06,297 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:06,327 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2025-02-08 14:21:06,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2025-02-08 14:21:06,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:21:06,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 14 transitions. [2025-02-08 14:21:06,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:21:06,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:21:06,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2025-02-08 14:21:06,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:21:06,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-02-08 14:21:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2025-02-08 14:21:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-08 14:21:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2025-02-08 14:21:06,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-02-08 14:21:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:21:06,357 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-02-08 14:21:06,358 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:21:06,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2025-02-08 14:21:06,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:21:06,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:06,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:06,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:21:06,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:06,359 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:06,359 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:21:06,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 2 times [2025-02-08 14:21:06,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:06,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753024839] [2025-02-08 14:21:06,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:06,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:06,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:21:06,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:21:06,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:21:06,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:06,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:06,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:21:06,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:21:06,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:06,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:06,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:06,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:06,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1137918, now seen corresponding path program 1 times [2025-02-08 14:21:06,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:06,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646421305] [2025-02-08 14:21:06,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:06,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:06,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:06,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:06,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:06,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:06,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:06,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:06,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:06,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:06,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:06,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:06,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:06,375 INFO L85 PathProgramCache]: Analyzing trace with hash 36231716, now seen corresponding path program 1 times [2025-02-08 14:21:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:06,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879781103] [2025-02-08 14:21:06,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:06,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:06,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:21:06,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:21:06,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:06,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:06,380 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:06,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:21:06,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:21:06,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:06,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:06,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:06,434 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:06,434 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:06,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:06,435 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:06,435 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:06,435 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:06,435 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:06,435 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:06,435 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2025-02-08 14:21:06,435 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:06,435 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:06,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:06,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:06,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:06,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:06,537 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:06,538 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:06,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:06,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:06,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:06,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:21:06,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:06,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:06,564 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:06,564 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:06,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-08 14:21:06,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:06,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:06,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:06,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:21:06,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:06,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:06,593 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:06,593 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:06,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-08 14:21:06,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:06,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:06,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:06,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:21:06,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:06,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:06,643 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:06,643 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:06,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-08 14:21:06,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:06,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:06,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:06,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:21:06,659 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:06,659 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:06,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:06,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:06,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:06,678 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:06,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:21:06,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:06,682 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:06,698 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:06,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-08 14:21:06,704 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:06,704 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:06,704 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:06,704 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:06,705 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:06,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:06,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:06,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:06,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2025-02-08 14:21:06,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:06,705 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:06,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:06,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:06,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:06,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:06,756 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:06,759 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:06,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:06,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:06,762 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:06,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:21:06,764 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-02-08 14:21:06,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:06,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:06,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:06,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:06,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:06,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:06,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:06,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-08 14:21:06,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:06,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:06,807 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:06,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:21:06,810 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-02-08 14:21:06,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:06,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:06,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:06,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:06,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:06,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:06,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:06,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-08 14:21:06,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:06,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:06,849 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:06,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:21:06,852 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-02-08 14:21:06,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:06,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:06,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:06,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:06,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:06,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:06,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:06,868 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:06,871 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:06,873 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:21:06,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:06,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:06,878 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:06,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:21:06,879 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:06,879 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:06,879 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:06,880 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2025-02-08 14:21:06,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-08 14:21:06,887 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:06,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:06,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:21:06,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:21:06,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:06,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:06,918 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:06,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:06,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:06,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:06,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:06,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:06,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:06,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:06,943 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-02-08 14:21:06,944 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:06,984 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 46 transitions. Complement of second has 7 states. [2025-02-08 14:21:06,984 INFO L141 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-02-08 14:21:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-02-08 14:21:06,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-08 14:21:06,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:06,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-08 14:21:06,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:06,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 8 letters. [2025-02-08 14:21:07,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:07,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 46 transitions. [2025-02-08 14:21:07,008 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2025-02-08 14:21:07,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 26 states and 40 transitions. [2025-02-08 14:21:07,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-08 14:21:07,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-02-08 14:21:07,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 40 transitions. [2025-02-08 14:21:07,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:07,009 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 40 transitions. [2025-02-08 14:21:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 40 transitions. [2025-02-08 14:21:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2025-02-08 14:21:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2025-02-08 14:21:07,011 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 32 transitions. [2025-02-08 14:21:07,011 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2025-02-08 14:21:07,011 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:21:07,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2025-02-08 14:21:07,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-08 14:21:07,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:21:07,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:07,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:07,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:21:07,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:07,011 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-02-08 14:21:07,012 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-02-08 14:21:07,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 1 times [2025-02-08 14:21:07,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:07,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724267768] [2025-02-08 14:21:07,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:07,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:21:07,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:21:07,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:07,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:21:07,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:21:07,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:07,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1106149, now seen corresponding path program 1 times [2025-02-08 14:21:07,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:07,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112661008] [2025-02-08 14:21:07,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:07,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:07,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:07,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:07,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:07,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:07,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:07,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:07,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1123184164, now seen corresponding path program 1 times [2025-02-08 14:21:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:07,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327651736] [2025-02-08 14:21:07,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:07,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:21:07,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:21:07,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:07,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:07,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327651736] [2025-02-08 14:21:07,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327651736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:07,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:07,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:21:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960469406] [2025-02-08 14:21:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:07,074 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:07,074 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:07,074 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:07,074 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:07,074 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:07,074 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,074 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:07,074 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:07,074 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2025-02-08 14:21:07,074 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:07,074 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:07,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,149 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:07,149 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:07,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:07,157 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:07,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:21:07,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:07,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:07,179 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:07,179 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:07,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-08 14:21:07,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:07,190 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:07,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:21:07,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:07,193 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:07,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:07,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:07,219 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:07,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:21:07,222 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:07,222 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:07,259 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:07,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:07,263 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:07,263 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:07,263 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:07,263 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:07,263 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:07,263 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,263 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:07,263 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:07,263 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2025-02-08 14:21:07,263 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:07,263 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:07,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,337 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:07,337 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:07,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:07,339 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:07,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:21:07,342 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-02-08 14:21:07,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:07,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:07,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:07,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:07,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:07,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:07,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:07,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-08 14:21:07,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:07,370 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:07,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:21:07,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:21:07,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:07,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:07,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:07,383 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:21:07,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:07,384 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-08 14:21:07,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:07,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:07,388 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:07,388 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:21:07,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:07,390 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:07,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:21:07,395 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:07,395 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:07,395 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:07,395 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2025-02-08 14:21:07,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-08 14:21:07,406 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:07,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:07,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:21:07,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:21:07,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:07,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:07,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:07,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:07,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:07,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:07,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:07,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:07,457 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-02-08 14:21:07,457 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:07,480 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 32 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 56 transitions. Complement of second has 7 states. [2025-02-08 14:21:07,480 INFO L141 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-02-08 14:21:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:21:07,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-08 14:21:07,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:07,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-08 14:21:07,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:07,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2025-02-08 14:21:07,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:07,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2025-02-08 14:21:07,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:21:07,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 30 states and 48 transitions. [2025-02-08 14:21:07,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-02-08 14:21:07,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-08 14:21:07,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 48 transitions. [2025-02-08 14:21:07,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:07,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 48 transitions. [2025-02-08 14:21:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 48 transitions. [2025-02-08 14:21:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-02-08 14:21:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2025-02-08 14:21:07,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 46 transitions. [2025-02-08 14:21:07,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:07,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:21:07,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:21:07,486 INFO L87 Difference]: Start difference. First operand 28 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:07,493 INFO L93 Difference]: Finished difference Result 36 states and 53 transitions. [2025-02-08 14:21:07,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 53 transitions. [2025-02-08 14:21:07,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-02-08 14:21:07,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 46 transitions. [2025-02-08 14:21:07,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-08 14:21:07,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-02-08 14:21:07,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2025-02-08 14:21:07,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:07,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 46 transitions. [2025-02-08 14:21:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2025-02-08 14:21:07,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-02-08 14:21:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. [2025-02-08 14:21:07,497 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 43 transitions. [2025-02-08 14:21:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:21:07,497 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2025-02-08 14:21:07,497 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:21:07,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 43 transitions. [2025-02-08 14:21:07,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-02-08 14:21:07,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:07,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:07,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:21:07,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:07,501 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:07,501 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:07,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash 37701, now seen corresponding path program 1 times [2025-02-08 14:21:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:07,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663218810] [2025-02-08 14:21:07,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:07,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:21:07,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:21:07,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:07,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:21:07,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:21:07,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:07,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:07,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1044829, now seen corresponding path program 1 times [2025-02-08 14:21:07,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:07,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235917168] [2025-02-08 14:21:07,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:07,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:07,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:07,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:07,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:07,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:07,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:07,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:07,526 INFO L85 PathProgramCache]: Analyzing trace with hash 458048161, now seen corresponding path program 1 times [2025-02-08 14:21:07,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:07,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723678449] [2025-02-08 14:21:07,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:07,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:07,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:21:07,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:21:07,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:07,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:07,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723678449] [2025-02-08 14:21:07,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723678449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:07,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:07,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:21:07,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81539668] [2025-02-08 14:21:07,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:07,595 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:07,596 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:07,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:07,596 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:07,596 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:07,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:07,596 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:07,596 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2025-02-08 14:21:07,596 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:07,596 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:07,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,654 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:07,654 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:07,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:07,658 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:07,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:21:07,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:07,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:07,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:07,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:07,684 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:07,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:07,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:07,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-08 14:21:07,696 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:07,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-08 14:21:07,704 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:07,704 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:07,704 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:07,704 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:07,704 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:07,704 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,704 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:07,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:07,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2025-02-08 14:21:07,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:07,705 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:07,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,762 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:07,762 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:07,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:07,765 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:07,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-08 14:21:07,771 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-02-08 14:21:07,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:07,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:07,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:07,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:07,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:07,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:07,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:07,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:07,795 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-08 14:21:07,795 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:21:07,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:07,798 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:07,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-08 14:21:07,799 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:07,799 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:07,799 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:07,799 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-08 14:21:07,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-08 14:21:07,807 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:07,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:07,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:21:07,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:21:07,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:07,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:07,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:07,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:07,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:07,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:07,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:07,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:07,849 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-02-08 14:21:07,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 43 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:07,872 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 43 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 84 transitions. Complement of second has 7 states. [2025-02-08 14:21:07,873 INFO L141 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-02-08 14:21:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-02-08 14:21:07,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-08 14:21:07,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:07,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-08 14:21:07,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:07,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 8 letters. [2025-02-08 14:21:07,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:07,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 84 transitions. [2025-02-08 14:21:07,874 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2025-02-08 14:21:07,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 49 states and 76 transitions. [2025-02-08 14:21:07,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-08 14:21:07,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-02-08 14:21:07,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 76 transitions. [2025-02-08 14:21:07,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:07,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 76 transitions. [2025-02-08 14:21:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 76 transitions. [2025-02-08 14:21:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 14:21:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 48 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 76 transitions. [2025-02-08 14:21:07,877 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 76 transitions. [2025-02-08 14:21:07,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:07,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:21:07,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:21:07,878 INFO L87 Difference]: Start difference. First operand 49 states and 76 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:07,893 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2025-02-08 14:21:07,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 77 transitions. [2025-02-08 14:21:07,893 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-02-08 14:21:07,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 77 transitions. [2025-02-08 14:21:07,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-02-08 14:21:07,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-02-08 14:21:07,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 77 transitions. [2025-02-08 14:21:07,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:07,894 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 77 transitions. [2025-02-08 14:21:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 77 transitions. [2025-02-08 14:21:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-02-08 14:21:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 51 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-02-08 14:21:07,896 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-02-08 14:21:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:21:07,897 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-02-08 14:21:07,897 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:21:07,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 75 transitions. [2025-02-08 14:21:07,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-02-08 14:21:07,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:07,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:07,897 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:21:07,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:07,898 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" [2025-02-08 14:21:07,898 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" [2025-02-08 14:21:07,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:07,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1168766, now seen corresponding path program 1 times [2025-02-08 14:21:07,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:07,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755650571] [2025-02-08 14:21:07,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:07,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:07,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:07,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:07,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,900 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:07,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:07,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:07,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:07,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:07,902 INFO L85 PathProgramCache]: Analyzing trace with hash 990020, now seen corresponding path program 1 times [2025-02-08 14:21:07,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:07,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936614489] [2025-02-08 14:21:07,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:07,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:07,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:07,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:07,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:07,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:07,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:07,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:07,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1343220289, now seen corresponding path program 1 times [2025-02-08 14:21:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:07,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465127506] [2025-02-08 14:21:07,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:07,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:21:07,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:21:07,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:07,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:21:07,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:21:07,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:07,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:07,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:07,939 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:07,939 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:07,939 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:07,939 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:07,939 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:07,939 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,939 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:07,939 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:07,939 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2025-02-08 14:21:07,939 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:07,939 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:07,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:07,989 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:07,989 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:07,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:07,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:07,991 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:07,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-08 14:21:07,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:07,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:08,012 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:08,012 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=4} Honda state: {ULTIMATE.start_main_~up~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:08,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-08 14:21:08,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,024 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-08 14:21:08,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:08,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:08,044 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:08,044 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:08,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:08,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,052 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-08 14:21:08,053 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:08,053 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:08,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-08 14:21:08,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,071 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-08 14:21:08,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:08,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:08,132 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:08,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:08,137 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:08,137 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:08,137 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:08,137 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:08,137 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:08,137 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,137 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:08,137 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:08,137 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2025-02-08 14:21:08,137 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:08,137 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:08,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:08,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-08 14:21:08,222 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:08,222 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:08,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,224 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-08 14:21:08,226 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-02-08 14:21:08,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:08,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:08,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:08,236 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:21:08,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:08,237 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-08 14:21:08,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:08,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:08,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-08 14:21:08,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,246 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-08 14:21:08,248 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-02-08 14:21:08,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:08,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:08,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:08,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:08,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:08,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:08,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:08,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-08 14:21:08,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,272 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-08 14:21:08,273 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-02-08 14:21:08,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:08,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:08,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:08,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:08,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:08,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:08,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:08,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:08,288 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:08,288 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:21:08,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,290 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-08 14:21:08,292 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:08,292 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:08,292 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:08,292 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-08 14:21:08,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:08,298 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:08,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:08,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:08,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:08,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:08,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:08,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:08,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:08,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:08,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:08,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:08,358 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-02-08 14:21:08,358 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 30 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,387 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 30. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 106 states and 153 transitions. Complement of second has 7 states. [2025-02-08 14:21:08,389 INFO L141 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-02-08 14:21:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-02-08 14:21:08,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-08 14:21:08,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:08,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-08 14:21:08,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:08,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 8 letters. [2025-02-08 14:21:08,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:08,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 153 transitions. [2025-02-08 14:21:08,395 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2025-02-08 14:21:08,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 92 states and 133 transitions. [2025-02-08 14:21:08,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-02-08 14:21:08,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-02-08 14:21:08,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 133 transitions. [2025-02-08 14:21:08,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:08,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 133 transitions. [2025-02-08 14:21:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 133 transitions. [2025-02-08 14:21:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2025-02-08 14:21:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.48) internal successors, (111), 74 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2025-02-08 14:21:08,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 111 transitions. [2025-02-08 14:21:08,410 INFO L432 stractBuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2025-02-08 14:21:08,410 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:21:08,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 111 transitions. [2025-02-08 14:21:08,411 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2025-02-08 14:21:08,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:08,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:08,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:21:08,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:08,412 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-02-08 14:21:08,412 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-02-08 14:21:08,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash 36231717, now seen corresponding path program 1 times [2025-02-08 14:21:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186966431] [2025-02-08 14:21:08,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:21:08,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:21:08,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:08,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:08,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186966431] [2025-02-08 14:21:08,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186966431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:08,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:08,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:21:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876392229] [2025-02-08 14:21:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:08,439 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:21:08,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1137919, now seen corresponding path program 1 times [2025-02-08 14:21:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130474558] [2025-02-08 14:21:08,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:08,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:08,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:08,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:08,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130474558] [2025-02-08 14:21:08,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130474558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:08,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:08,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:21:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942036741] [2025-02-08 14:21:08,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:08,454 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:21:08,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:08,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:21:08,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:21:08,455 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. cyclomatic complexity: 46 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:08,470 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2025-02-08 14:21:08,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2025-02-08 14:21:08,471 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-02-08 14:21:08,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 49 states and 65 transitions. [2025-02-08 14:21:08,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-02-08 14:21:08,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-02-08 14:21:08,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 65 transitions. [2025-02-08 14:21:08,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:08,472 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 65 transitions. [2025-02-08 14:21:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 65 transitions. [2025-02-08 14:21:08,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2025-02-08 14:21:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 41 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2025-02-08 14:21:08,474 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-02-08 14:21:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:21:08,475 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-02-08 14:21:08,475 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:21:08,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2025-02-08 14:21:08,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-02-08 14:21:08,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:08,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:08,476 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:21:08,476 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:08,476 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:21:08,476 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:21:08,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1314591137, now seen corresponding path program 1 times [2025-02-08 14:21:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080027936] [2025-02-08 14:21:08,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:08,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:21:08,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:21:08,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:08,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:08,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080027936] [2025-02-08 14:21:08,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080027936] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:08,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790882946] [2025-02-08 14:21:08,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:08,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:08,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,535 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-02-08 14:21:08,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:21:08,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:21:08,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:08,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:21:08,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:08,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:08,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790882946] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:08,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:08,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 14:21:08,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707053793] [2025-02-08 14:21:08,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:08,578 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:21:08,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,578 INFO L85 PathProgramCache]: Analyzing trace with hash 960228, now seen corresponding path program 2 times [2025-02-08 14:21:08,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306220278] [2025-02-08 14:21:08,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:08,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:08,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:08,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:21:08,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:08,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:08,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:08,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:08,609 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:08,609 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:08,609 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:08,609 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:08,609 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:08,609 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,609 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:08,609 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:08,609 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2025-02-08 14:21:08,609 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:08,609 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:08,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,658 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:08,658 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:08,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,660 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-08 14:21:08,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:08,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:08,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:08,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,681 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-08 14:21:08,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:08,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:08,703 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:08,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-08 14:21:08,707 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:08,708 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:08,708 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:08,708 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:08,708 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:08,708 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,708 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:08,708 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:08,708 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2025-02-08 14:21:08,708 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:08,708 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:08,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,751 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:08,751 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:08,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,757 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-08 14:21:08,759 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-02-08 14:21:08,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:08,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:08,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:08,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:08,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:08,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:08,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:08,772 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:08,775 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:08,775 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:21:08,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,777 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-08 14:21:08,779 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:08,779 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:08,779 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:08,779 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-08 14:21:08,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:08,786 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:08,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:21:08,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:21:08,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:08,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:08,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:08,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:08,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:08,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:08,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:08,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:08,826 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-02-08 14:21:08,826 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 55 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,853 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 55 transitions. cyclomatic complexity: 19. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 103 states and 131 transitions. Complement of second has 7 states. [2025-02-08 14:21:08,853 INFO L141 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-02-08 14:21:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2025-02-08 14:21:08,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-08 14:21:08,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:08,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 4 letters. [2025-02-08 14:21:08,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:08,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2025-02-08 14:21:08,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:08,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 131 transitions. [2025-02-08 14:21:08,855 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2025-02-08 14:21:08,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 96 states and 123 transitions. [2025-02-08 14:21:08,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-02-08 14:21:08,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-02-08 14:21:08,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 123 transitions. [2025-02-08 14:21:08,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:08,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 123 transitions. [2025-02-08 14:21:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 123 transitions. [2025-02-08 14:21:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2025-02-08 14:21:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 83 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2025-02-08 14:21:08,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 111 transitions. [2025-02-08 14:21:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:08,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:21:08,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:21:08,859 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:08,885 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2025-02-08 14:21:08,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 149 transitions. [2025-02-08 14:21:08,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2025-02-08 14:21:08,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 109 states and 129 transitions. [2025-02-08 14:21:08,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-02-08 14:21:08,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-02-08 14:21:08,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 129 transitions. [2025-02-08 14:21:08,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:08,887 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 129 transitions. [2025-02-08 14:21:08,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 129 transitions. [2025-02-08 14:21:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2025-02-08 14:21:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 97 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2025-02-08 14:21:08,891 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 118 transitions. [2025-02-08 14:21:08,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:21:08,891 INFO L432 stractBuchiCegarLoop]: Abstraction has 98 states and 118 transitions. [2025-02-08 14:21:08,891 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:21:08,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 118 transitions. [2025-02-08 14:21:08,892 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-02-08 14:21:08,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:08,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:08,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:21:08,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:08,893 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:21:08,893 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:21:08,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1309844031, now seen corresponding path program 1 times [2025-02-08 14:21:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574831347] [2025-02-08 14:21:08,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:21:08,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:21:08,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:08,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:21:08,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:21:08,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:08,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1137949, now seen corresponding path program 2 times [2025-02-08 14:21:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998450640] [2025-02-08 14:21:08,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:08,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:08,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:21:08,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:08,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:08,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:08,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:08,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,904 INFO L85 PathProgramCache]: Analyzing trace with hash 479845085, now seen corresponding path program 2 times [2025-02-08 14:21:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054900741] [2025-02-08 14:21:08,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-08 14:21:08,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:21:08,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:21:08,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:08,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:21:08,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:21:08,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:08,939 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:08,939 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:08,939 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:08,939 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:08,939 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:08,939 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,939 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:08,939 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:08,939 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2025-02-08 14:21:08,939 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:08,939 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:08,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,996 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:08,996 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:08,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,998 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-08 14:21:09,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:09,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:09,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,020 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-08 14:21:09,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:09,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:09,036 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:09,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,042 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:09,042 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:09,042 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:09,042 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:09,042 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:09,042 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,042 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:09,042 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:09,042 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2025-02-08 14:21:09,042 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:09,042 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:09,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,097 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:09,097 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:09,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,099 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-08 14:21:09,101 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-02-08 14:21:09,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:09,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:09,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:09,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:09,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:09,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:09,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:09,113 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:09,115 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:09,115 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:21:09,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,117 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-08 14:21:09,119 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:09,119 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:09,119 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:09,119 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2025-02-08 14:21:09,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-02-08 14:21:09,125 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:09,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:21:09,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:21:09,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:09,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:09,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:09,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:09,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,159 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:21:09,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:09,189 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-02-08 14:21:09,189 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 98 states and 118 transitions. cyclomatic complexity: 30 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-08 14:21:09,240 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 98 states and 118 transitions. cyclomatic complexity: 30. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 129 states and 155 transitions. Complement of second has 7 states. [2025-02-08 14:21:09,243 INFO L141 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-02-08 14:21:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-02-08 14:21:09,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-08 14:21:09,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:09,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 4 letters. [2025-02-08 14:21:09,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:09,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 8 letters. [2025-02-08 14:21:09,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:09,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 155 transitions. [2025-02-08 14:21:09,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2025-02-08 14:21:09,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 107 states and 130 transitions. [2025-02-08 14:21:09,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-02-08 14:21:09,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-02-08 14:21:09,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 130 transitions. [2025-02-08 14:21:09,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:09,246 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 130 transitions. [2025-02-08 14:21:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 130 transitions. [2025-02-08 14:21:09,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2025-02-08 14:21:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 90 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2025-02-08 14:21:09,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 109 transitions. [2025-02-08 14:21:09,251 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2025-02-08 14:21:09,251 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:21:09,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 109 transitions. [2025-02-08 14:21:09,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2025-02-08 14:21:09,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:09,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:09,252 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 2, 1, 1, 1] [2025-02-08 14:21:09,252 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2025-02-08 14:21:09,255 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:09,255 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:09,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1005479669, now seen corresponding path program 1 times [2025-02-08 14:21:09,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:09,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945247779] [2025-02-08 14:21:09,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:09,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:09,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 14:21:09,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 14:21:09,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 14:21:09,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945247779] [2025-02-08 14:21:09,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945247779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:09,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:09,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:21:09,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238787066] [2025-02-08 14:21:09,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:09,303 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:21:09,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,303 INFO L85 PathProgramCache]: Analyzing trace with hash 240393649, now seen corresponding path program 1 times [2025-02-08 14:21:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:09,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266885661] [2025-02-08 14:21:09,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:09,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:21:09,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:21:09,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:21:09,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:09,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266885661] [2025-02-08 14:21:09,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266885661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:09,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:09,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:21:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568483068] [2025-02-08 14:21:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:09,329 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:21:09,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:09,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:21:09,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:21:09,330 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. cyclomatic complexity: 26 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:09,347 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2025-02-08 14:21:09,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 131 transitions. [2025-02-08 14:21:09,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2025-02-08 14:21:09,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 110 states and 129 transitions. [2025-02-08 14:21:09,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-02-08 14:21:09,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-02-08 14:21:09,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 129 transitions. [2025-02-08 14:21:09,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:09,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 129 transitions. [2025-02-08 14:21:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 129 transitions. [2025-02-08 14:21:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2025-02-08 14:21:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.1702127659574468) internal successors, (110), 93 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2025-02-08 14:21:09,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 110 transitions. [2025-02-08 14:21:09,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:21:09,352 INFO L432 stractBuchiCegarLoop]: Abstraction has 94 states and 110 transitions. [2025-02-08 14:21:09,352 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:21:09,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 110 transitions. [2025-02-08 14:21:09,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-02-08 14:21:09,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:09,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:09,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1] [2025-02-08 14:21:09,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2025-02-08 14:21:09,353 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:09,353 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1071108625, now seen corresponding path program 2 times [2025-02-08 14:21:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457767292] [2025-02-08 14:21:09,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:09,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 14:21:09,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:21:09,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:21:09,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:21:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457767292] [2025-02-08 14:21:09,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457767292] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833865955] [2025-02-08 14:21:09,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:09,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:09,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,406 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-02-08 14:21:09,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 14:21:09,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:21:09,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:21:09,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:21:09,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:21:09,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:21:09,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833865955] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:09,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:09,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-08 14:21:09,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393919690] [2025-02-08 14:21:09,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:09,572 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:21:09,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1724631757, now seen corresponding path program 2 times [2025-02-08 14:21:09,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:09,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578949408] [2025-02-08 14:21:09,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:09,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:09,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 14:21:09,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:21:09,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:21:09,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:21:09,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578949408] [2025-02-08 14:21:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578949408] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000952427] [2025-02-08 14:21:09,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:09,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:09,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,644 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-02-08 14:21:09,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 14:21:09,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:21:09,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:21:09,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:09,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:21:09,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:21:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000952427] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:09,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:09,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 14:21:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444958270] [2025-02-08 14:21:09,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:09,701 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:21:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:09,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:21:09,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:21:09,702 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. cyclomatic complexity: 24 Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:09,741 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2025-02-08 14:21:09,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 229 transitions. [2025-02-08 14:21:09,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2025-02-08 14:21:09,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 190 states and 221 transitions. [2025-02-08 14:21:09,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-02-08 14:21:09,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-02-08 14:21:09,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 221 transitions. [2025-02-08 14:21:09,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:09,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 190 states and 221 transitions. [2025-02-08 14:21:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 221 transitions. [2025-02-08 14:21:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 142. [2025-02-08 14:21:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 1.1408450704225352) internal successors, (162), 141 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2025-02-08 14:21:09,748 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 162 transitions. [2025-02-08 14:21:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:21:09,748 INFO L432 stractBuchiCegarLoop]: Abstraction has 142 states and 162 transitions. [2025-02-08 14:21:09,748 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:21:09,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 162 transitions. [2025-02-08 14:21:09,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2025-02-08 14:21:09,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:09,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:09,750 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 9, 9, 6, 4, 2, 1, 1] [2025-02-08 14:21:09,750 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 6, 4, 1, 1] [2025-02-08 14:21:09,750 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:09,750 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash 371602049, now seen corresponding path program 3 times [2025-02-08 14:21:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541971269] [2025-02-08 14:21:09,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:21:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:09,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-02-08 14:21:09,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 35 of 43 statements. [2025-02-08 14:21:09,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-08 14:21:09,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 14:21:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541971269] [2025-02-08 14:21:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541971269] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971642912] [2025-02-08 14:21:09,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:21:09,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:09,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,822 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-02-08 14:21:09,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-02-08 14:21:09,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 35 of 43 statements. [2025-02-08 14:21:09,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-08 14:21:09,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:21:09,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 14:21:09,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 14:21:09,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971642912] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:09,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:09,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-02-08 14:21:09,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987793617] [2025-02-08 14:21:09,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:09,968 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:21:09,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1024904387, now seen corresponding path program 3 times [2025-02-08 14:21:09,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:09,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18528960] [2025-02-08 14:21:09,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:21:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:09,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 10 equivalence classes. [2025-02-08 14:21:09,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 32 of 40 statements. [2025-02-08 14:21:09,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 14:21:09,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:21:10,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:10,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18528960] [2025-02-08 14:21:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18528960] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:10,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502179412] [2025-02-08 14:21:10,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:21:10,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:10,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,087 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-02-08 14:21:10,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 10 equivalence classes. [2025-02-08 14:21:10,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 32 of 40 statements. [2025-02-08 14:21:10,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 14:21:10,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:10,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:21:10,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:21:10,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:21:10,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502179412] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:10,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-02-08 14:21:10,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252252602] [2025-02-08 14:21:10,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:10,290 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:21:10,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:10,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:21:10,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:21:10,290 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. cyclomatic complexity: 28 Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:10,347 INFO L93 Difference]: Finished difference Result 278 states and 321 transitions. [2025-02-08 14:21:10,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 321 transitions. [2025-02-08 14:21:10,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2025-02-08 14:21:10,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 270 states and 313 transitions. [2025-02-08 14:21:10,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-02-08 14:21:10,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-02-08 14:21:10,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 313 transitions. [2025-02-08 14:21:10,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:10,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 313 transitions. [2025-02-08 14:21:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 313 transitions. [2025-02-08 14:21:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 190. [2025-02-08 14:21:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 190 states have (on average 1.1263157894736842) internal successors, (214), 189 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 214 transitions. [2025-02-08 14:21:10,357 INFO L240 hiAutomatonCegarLoop]: Abstraction has 190 states and 214 transitions. [2025-02-08 14:21:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:21:10,360 INFO L432 stractBuchiCegarLoop]: Abstraction has 190 states and 214 transitions. [2025-02-08 14:21:10,361 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-08 14:21:10,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 214 transitions. [2025-02-08 14:21:10,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2025-02-08 14:21:10,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:10,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:10,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 13, 13, 10, 4, 2, 1, 1] [2025-02-08 14:21:10,362 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2025-02-08 14:21:10,362 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:10,362 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:10,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1912229135, now seen corresponding path program 4 times [2025-02-08 14:21:10,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:10,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565265045] [2025-02-08 14:21:10,363 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:21:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:10,369 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-02-08 14:21:10,374 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 14:21:10,378 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:21:10,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 193 proven. 28 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-02-08 14:21:10,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565265045] [2025-02-08 14:21:10,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565265045] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990507627] [2025-02-08 14:21:10,441 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:21:10,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:10,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,444 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-02-08 14:21:10,464 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-02-08 14:21:10,474 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 14:21:10,474 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:21:10,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:10,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:21:10,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 193 proven. 28 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-02-08 14:21:10,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 193 proven. 28 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-02-08 14:21:10,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990507627] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:10,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:10,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-08 14:21:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663465022] [2025-02-08 14:21:10,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:10,559 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:21:10,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1853375571, now seen corresponding path program 4 times [2025-02-08 14:21:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:10,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817023445] [2025-02-08 14:21:10,560 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:21:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:10,563 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-02-08 14:21:10,566 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 14:21:10,566 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:21:10,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,566 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:10,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 14:21:10,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 14:21:10,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:10,814 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:10,814 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:10,814 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:10,814 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:10,814 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:10,815 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,815 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:10,815 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:10,815 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration12_Loop [2025-02-08 14:21:10,815 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:10,815 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:10,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,887 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:10,887 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:10,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,892 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-08 14:21:10,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:10,894 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:10,916 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:10,916 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:10,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:10,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,925 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-08 14:21:10,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:10,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:10,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-02-08 14:21:10,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,947 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-08 14:21:10,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:10,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:10,961 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:10,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:10,967 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:10,967 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:10,967 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:10,967 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:10,968 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:10,968 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,968 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:10,968 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:10,968 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration12_Loop [2025-02-08 14:21:10,968 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:10,968 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:10,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,023 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:11,023 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:11,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,027 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-02-08 14:21:11,031 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-02-08 14:21:11,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:11,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:11,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:11,043 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:21:11,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:11,044 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-08 14:21:11,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:11,049 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:11,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-02-08 14:21:11,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,058 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-08 14:21:11,064 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-02-08 14:21:11,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:11,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:11,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:11,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:11,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:11,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:11,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:11,087 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:11,090 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:11,090 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:21:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,141 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-08 14:21:11,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:11,143 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:11,143 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:11,143 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 7 Supporting invariants [] [2025-02-08 14:21:11,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:11,156 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:11,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:11,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 14:21:11,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 14:21:11,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:11,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:11,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:11,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 14:21:11,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 14:21:11,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:11,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:21:11,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-02-08 14:21:11,372 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-02-08 14:21:11,372 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 190 states and 214 transitions. cyclomatic complexity: 32 Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,581 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 190 states and 214 transitions. cyclomatic complexity: 32. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 664 states and 754 transitions. Complement of second has 23 states. [2025-02-08 14:21:11,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-02-08 14:21:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2025-02-08 14:21:11,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 59 letters. Loop has 56 letters. [2025-02-08 14:21:11,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:11,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 115 letters. Loop has 56 letters. [2025-02-08 14:21:11,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:11,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 59 letters. Loop has 112 letters. [2025-02-08 14:21:11,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:11,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 664 states and 754 transitions. [2025-02-08 14:21:11,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-08 14:21:11,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2025-02-08 14:21:11,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 664 states to 546 states and 615 transitions. [2025-02-08 14:21:11,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2025-02-08 14:21:11,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2025-02-08 14:21:11,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 615 transitions. [2025-02-08 14:21:11,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:11,620 INFO L218 hiAutomatonCegarLoop]: Abstraction has 546 states and 615 transitions. [2025-02-08 14:21:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 615 transitions. [2025-02-08 14:21:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 498. [2025-02-08 14:21:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 498 states have (on average 1.1365461847389557) internal successors, (566), 497 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 566 transitions. [2025-02-08 14:21:11,626 INFO L240 hiAutomatonCegarLoop]: Abstraction has 498 states and 566 transitions. [2025-02-08 14:21:11,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:11,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:21:11,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:21:11,628 INFO L87 Difference]: Start difference. First operand 498 states and 566 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:11,679 INFO L93 Difference]: Finished difference Result 309 states and 333 transitions. [2025-02-08 14:21:11,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 309 states and 333 transitions. [2025-02-08 14:21:11,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2025-02-08 14:21:11,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 309 states to 267 states and 291 transitions. [2025-02-08 14:21:11,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-02-08 14:21:11,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-02-08 14:21:11,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 291 transitions. [2025-02-08 14:21:11,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:11,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 267 states and 291 transitions. [2025-02-08 14:21:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 291 transitions. [2025-02-08 14:21:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2025-02-08 14:21:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 262 states have (on average 1.0916030534351144) internal successors, (286), 261 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 286 transitions. [2025-02-08 14:21:11,685 INFO L240 hiAutomatonCegarLoop]: Abstraction has 262 states and 286 transitions. [2025-02-08 14:21:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:21:11,686 INFO L432 stractBuchiCegarLoop]: Abstraction has 262 states and 286 transitions. [2025-02-08 14:21:11,687 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-08 14:21:11,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 262 states and 286 transitions. [2025-02-08 14:21:11,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-02-08 14:21:11,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:11,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:11,690 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 19, 19, 10, 10, 2, 1, 1] [2025-02-08 14:21:11,690 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2025-02-08 14:21:11,690 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:11,690 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:11,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:11,691 INFO L85 PathProgramCache]: Analyzing trace with hash -784565345, now seen corresponding path program 5 times [2025-02-08 14:21:11,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:11,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026608396] [2025-02-08 14:21:11,691 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:21:11,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:11,695 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 83 statements into 21 equivalence classes. [2025-02-08 14:21:11,700 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 14:21:11,700 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-02-08 14:21:11,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:11,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 14:21:11,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 14:21:11,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:11,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2069950373, now seen corresponding path program 5 times [2025-02-08 14:21:11,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:11,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621187159] [2025-02-08 14:21:11,707 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:21:11,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:11,710 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 80 statements into 20 equivalence classes. [2025-02-08 14:21:11,715 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 14:21:11,715 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-02-08 14:21:11,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,715 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:11,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 14:21:11,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 14:21:11,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:11,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1427152889, now seen corresponding path program 6 times [2025-02-08 14:21:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:11,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17547266] [2025-02-08 14:21:11,724 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:21:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:11,731 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 163 statements into 41 equivalence classes. [2025-02-08 14:21:11,749 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 14:21:11,749 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2025-02-08 14:21:11,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:11,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 14:21:11,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 14:21:11,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:12,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 14:21:12,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 14:21:12,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:12,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:12,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 14:21:12,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 14:21:12,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:12,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:21:12 BoogieIcfgContainer [2025-02-08 14:21:12,614 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:21:12,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:21:12,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:21:12,615 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:21:12,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:21:06" (3/4) ... [2025-02-08 14:21:12,619 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-08 14:21:12,669 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:21:12,670 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:21:12,670 INFO L158 Benchmark]: Toolchain (without parser) took 7124.22ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 105.2MB in the beginning and 130.5MB in the end (delta: -25.3MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB. [2025-02-08 14:21:12,670 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:21:12,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.33ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 95.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:21:12,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.69ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.5MB in the end (delta: 873.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:21:12,671 INFO L158 Benchmark]: Boogie Preprocessor took 26.52ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.6MB in the end (delta: 815.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:21:12,671 INFO L158 Benchmark]: IcfgBuilder took 161.63ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 84.9MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:21:12,671 INFO L158 Benchmark]: BuchiAutomizer took 6592.05ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 84.9MB in the beginning and 137.5MB in the end (delta: -52.6MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2025-02-08 14:21:12,672 INFO L158 Benchmark]: Witness Printer took 55.25ms. Allocated memory is still 285.2MB. Free memory was 137.5MB in the beginning and 130.5MB in the end (delta: 7.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:21:12,673 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.33ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 95.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.69ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.5MB in the end (delta: 873.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.52ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.6MB in the end (delta: 815.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 161.63ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 84.9MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6592.05ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 84.9MB in the beginning and 137.5MB in the end (delta: -52.6MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. * Witness Printer took 55.25ms. Allocated memory is still 285.2MB. Free memory was 137.5MB in the beginning and 130.5MB in the end (delta: 7.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (9 trivial, 7 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 19) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function ((long) -1 * i) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 19) and consists of 4 locations. One deterministic module has affine ranking function (7 + ((long) -1 * i)) and consists of 12 locations. 9 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 262 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 13 iterations. TraceHistogramMax:21. Analysis of lassos took 5.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 272 StatesRemovedByMinimization, 14 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 [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 171/364 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 482 IncrementalHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 103 mSDtfsCounter, 482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT3 conc0 concLT2 SILN0 SILU0 SILI4 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax171 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq181 hnf93 smp86 dnf119 smp96 tf110 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=0] [L12] COND TRUE i == 10 [L13] up = 0 VAL [i=10, up=0] [L15] COND FALSE !(i == 0) VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=0] [L12] COND FALSE !(i == 10) VAL [i=9, up=0] [L15] COND FALSE !(i == 0) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=8, up=0] [L12] COND FALSE !(i == 10) VAL [i=8, up=0] [L15] COND FALSE !(i == 0) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=7, up=0] [L12] COND FALSE !(i == 10) VAL [i=7, up=0] [L15] COND FALSE !(i == 0) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=6, up=0] [L12] COND FALSE !(i == 10) VAL [i=6, up=0] [L15] COND FALSE !(i == 0) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=5, up=0] [L12] COND FALSE !(i == 10) VAL [i=5, up=0] [L15] COND FALSE !(i == 0) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=4, up=0] [L12] COND FALSE !(i == 10) VAL [i=4, up=0] [L15] COND FALSE !(i == 0) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=3, up=0] [L12] COND FALSE !(i == 10) VAL [i=3, up=0] [L15] COND FALSE !(i == 0) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=2, up=0] [L12] COND FALSE !(i == 10) VAL [i=2, up=0] [L15] COND FALSE !(i == 0) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=0] [L12] COND FALSE !(i == 10) VAL [i=1, up=0] [L15] COND FALSE !(i == 0) VAL [i=1, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=0, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i == 10) VAL [i=0, up=0] [L15] COND TRUE i == 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i == 10) VAL [i=1, up=1] [L15] COND FALSE !(i == 0) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=2, up=1] [L12] COND FALSE !(i == 10) VAL [i=2, up=1] [L15] COND FALSE !(i == 0) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=3, up=1] [L12] COND FALSE !(i == 10) VAL [i=3, up=1] [L15] COND FALSE !(i == 0) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=4, up=1] [L12] COND FALSE !(i == 10) VAL [i=4, up=1] [L15] COND FALSE !(i == 0) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=5, up=1] [L12] COND FALSE !(i == 10) VAL [i=5, up=1] [L15] COND FALSE !(i == 0) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=6, up=1] [L12] COND FALSE !(i == 10) VAL [i=6, up=1] [L15] COND FALSE !(i == 0) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=7, up=1] [L12] COND FALSE !(i == 10) VAL [i=7, up=1] [L15] COND FALSE !(i == 0) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=8, up=1] [L12] COND FALSE !(i == 10) VAL [i=8, up=1] [L15] COND FALSE !(i == 0) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=1] [L12] COND FALSE !(i == 10) VAL [i=9, up=1] [L15] COND FALSE !(i == 0) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=1] [L12] COND TRUE i == 10 [L13] up = 0 VAL [i=10, up=0] Loop: [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 15]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=0] [L12] COND TRUE i == 10 [L13] up = 0 VAL [i=10, up=0] [L15] COND FALSE !(i == 0) VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=0] [L12] COND FALSE !(i == 10) VAL [i=9, up=0] [L15] COND FALSE !(i == 0) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=8, up=0] [L12] COND FALSE !(i == 10) VAL [i=8, up=0] [L15] COND FALSE !(i == 0) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=7, up=0] [L12] COND FALSE !(i == 10) VAL [i=7, up=0] [L15] COND FALSE !(i == 0) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=6, up=0] [L12] COND FALSE !(i == 10) VAL [i=6, up=0] [L15] COND FALSE !(i == 0) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=5, up=0] [L12] COND FALSE !(i == 10) VAL [i=5, up=0] [L15] COND FALSE !(i == 0) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=4, up=0] [L12] COND FALSE !(i == 10) VAL [i=4, up=0] [L15] COND FALSE !(i == 0) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=3, up=0] [L12] COND FALSE !(i == 10) VAL [i=3, up=0] [L15] COND FALSE !(i == 0) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=2, up=0] [L12] COND FALSE !(i == 10) VAL [i=2, up=0] [L15] COND FALSE !(i == 0) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=0] [L12] COND FALSE !(i == 10) VAL [i=1, up=0] [L15] COND FALSE !(i == 0) VAL [i=1, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=0, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i == 10) VAL [i=0, up=0] [L15] COND TRUE i == 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i == 10) VAL [i=1, up=1] [L15] COND FALSE !(i == 0) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=2, up=1] [L12] COND FALSE !(i == 10) VAL [i=2, up=1] [L15] COND FALSE !(i == 0) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=3, up=1] [L12] COND FALSE !(i == 10) VAL [i=3, up=1] [L15] COND FALSE !(i == 0) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=4, up=1] [L12] COND FALSE !(i == 10) VAL [i=4, up=1] [L15] COND FALSE !(i == 0) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=5, up=1] [L12] COND FALSE !(i == 10) VAL [i=5, up=1] [L15] COND FALSE !(i == 0) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=6, up=1] [L12] COND FALSE !(i == 10) VAL [i=6, up=1] [L15] COND FALSE !(i == 0) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=7, up=1] [L12] COND FALSE !(i == 10) VAL [i=7, up=1] [L15] COND FALSE !(i == 0) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=8, up=1] [L12] COND FALSE !(i == 10) VAL [i=8, up=1] [L15] COND FALSE !(i == 0) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=1] [L12] COND FALSE !(i == 10) VAL [i=9, up=1] [L15] COND FALSE !(i == 0) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=1] [L12] COND TRUE i == 10 [L13] up = 0 VAL [i=10, up=0] Loop: [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-08 14:21:12,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:12,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:13,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:13,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-02-08 14:21:13,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:13,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-02-08 14:21:13,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)