./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc 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/UpAndDownIneq.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 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:01:39,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:01:40,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:01:40,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:01:40,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:01:40,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:01:40,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:01:40,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:01:40,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:01:40,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:01:40,027 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:01:40,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:01:40,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:01:40,027 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:01:40,027 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:01:40,027 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:01:40,027 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:01:40,028 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:01:40,028 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:01:40,028 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:01:40,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:01:40,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:01:40,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:01:40,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:01:40,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:01:40,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:01:40,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:01:40,028 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:01:40,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:01:40,029 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:01:40,029 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:01:40,029 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:01:40,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:01:40,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:01:40,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:01:40,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:01:40,029 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:01:40,029 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 -> 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 [2025-02-06 19:01:40,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:01:40,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:01:40,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:01:40,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:01:40,238 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:01:40,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2025-02-06 19:01:41,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76e3e21de/49f36190949249f5bd358e3a8e32d37c/FLAGa8113ba90 [2025-02-06 19:01:41,730 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:01:41,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2025-02-06 19:01:41,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76e3e21de/49f36190949249f5bd358e3a8e32d37c/FLAGa8113ba90 [2025-02-06 19:01:41,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76e3e21de/49f36190949249f5bd358e3a8e32d37c [2025-02-06 19:01:41,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:01:41,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:01:41,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:01:41,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:01:41,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:01:41,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ead6f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41, skipping insertion in model container [2025-02-06 19:01:41,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:01:41,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:01:41,863 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:01:41,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:01:41,880 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:01:41,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41 WrapperNode [2025-02-06 19:01:41,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:01:41,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:01:41,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:01:41,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:01:41,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,896 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-02-06 19:01:41,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:01:41,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:01:41,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:01:41,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:01:41,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,905 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 19:01:41,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:01:41,911 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:01:41,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:01:41,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:01:41,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (1/1) ... [2025-02-06 19:01:41,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:41,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:41,937 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-06 19:01:41,946 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-06 19:01:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:01:41,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:01:42,001 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:01:42,002 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:01:42,048 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-02-06 19:01:42,048 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:01:42,052 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:01:42,053 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:01:42,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:01:42 BoogieIcfgContainer [2025-02-06 19:01:42,053 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:01:42,054 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:01:42,054 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:01:42,057 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:01:42,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:01:42,058 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:01:41" (1/3) ... [2025-02-06 19:01:42,058 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63965870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:01:42, skipping insertion in model container [2025-02-06 19:01:42,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:01:42,058 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:41" (2/3) ... [2025-02-06 19:01:42,059 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63965870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:01:42, skipping insertion in model container [2025-02-06 19:01:42,059 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:01:42,059 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:01:42" (3/3) ... [2025-02-06 19:01:42,059 INFO L363 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2025-02-06 19:01:42,087 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:01:42,088 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:01:42,088 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:01:42,088 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:01:42,088 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:01:42,088 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:01:42,088 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:01:42,088 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:01:42,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-06 19:01:42,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:01:42,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:42,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:42,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:01:42,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:01:42,102 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:01:42,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-06 19:01:42,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:01:42,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:42,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:42,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:01:42,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:01:42,106 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-06 19:01:42,107 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-06 19:01:42,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:42,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1312, now seen corresponding path program 1 times [2025-02-06 19:01:42,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:42,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109338189] [2025-02-06 19:01:42,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:42,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:42,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:42,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:42,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:42,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:42,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:42,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:42,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:42,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1198525, now seen corresponding path program 1 times [2025-02-06 19:01:42,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:42,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61941088] [2025-02-06 19:01:42,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:42,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:42,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:42,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:42,213 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-06 19:01:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:42,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61941088] [2025-02-06 19:01:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61941088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:42,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:42,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:01:42,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160837773] [2025-02-06 19:01:42,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:42,217 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:42,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:01:42,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:01:42,234 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-06 19:01:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:42,260 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2025-02-06 19:01:42,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2025-02-06 19:01:42,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-06 19:01:42,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 10 states and 14 transitions. [2025-02-06 19:01:42,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:01:42,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:01:42,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-02-06 19:01:42,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:01:42,266 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-02-06 19:01:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-02-06 19:01:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-06 19:01:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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-06 19:01:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-02-06 19:01:42,280 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-02-06 19:01:42,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:01:42,283 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-02-06 19:01:42,283 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:01:42,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-02-06 19:01:42,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-06 19:01:42,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:42,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:42,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:01:42,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:01:42,284 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-06 19:01:42,284 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-06 19:01:42,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1312, now seen corresponding path program 2 times [2025-02-06 19:01:42,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:42,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458660261] [2025-02-06 19:01:42,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:42,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:42,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:42,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:42,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:01:42,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:42,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:42,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:42,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:42,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1199486, now seen corresponding path program 1 times [2025-02-06 19:01:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560279653] [2025-02-06 19:01:42,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:42,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:42,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:42,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:42,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:42,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:42,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:42,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:42,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1211935517, now seen corresponding path program 1 times [2025-02-06 19:01:42,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:42,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108280822] [2025-02-06 19:01:42,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:42,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:42,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:42,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,303 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:42,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:42,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:42,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:42,349 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:42,349 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:42,349 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:42,349 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:42,349 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:42,349 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:42,349 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:42,350 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:42,350 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2025-02-06 19:01:42,350 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:42,350 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:42,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:42,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:42,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:42,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:42,420 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:42,421 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:42,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:42,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:42,428 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-06 19:01:42,430 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-06 19:01:42,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:42,431 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:42,445 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:42,445 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-06 19:01:42,451 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-06 19:01:42,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:42,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:42,454 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-06 19:01:42,455 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-06 19:01:42,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:42,456 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:42,475 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:42,475 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-06 19:01:42,481 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-06 19:01:42,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:42,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:42,483 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-06 19:01:42,484 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-06 19:01:42,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:42,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:42,503 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:42,503 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-06 19:01:42,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:42,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:42,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:42,512 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-06 19:01:42,513 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-06 19:01:42,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:42,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:42,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:01:42,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:42,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:42,536 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-06 19:01:42,537 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-06 19:01:42,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:42,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:42,552 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:42,557 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-06 19:01:42,558 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:42,558 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:42,558 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:42,558 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:42,558 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:42,558 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:42,558 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:42,558 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:42,558 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2025-02-06 19:01:42,558 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:42,558 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:42,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:42,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:42,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:42,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:42,614 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:42,617 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:42,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:42,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:42,619 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-06 19:01:42,621 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-06 19:01:42,622 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-06 19:01:42,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:42,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:42,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:42,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:42,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:42,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:42,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:42,653 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-06 19:01:42,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:42,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:42,655 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-06 19:01:42,656 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-06 19:01:42,659 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-06 19:01:42,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:42,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:42,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:42,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:42,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:42,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:42,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:42,682 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-06 19:01:42,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:42,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:42,686 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-06 19:01:42,687 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-06 19:01:42,688 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-06 19:01:42,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:42,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:42,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:42,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:42,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:42,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:42,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:42,702 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:42,705 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:42,707 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:01:42,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:42,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:42,711 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-06 19:01:42,712 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-06 19:01:42,713 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:42,714 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:42,714 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:42,714 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-06 19:01:42,720 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-06 19:01:42,723 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:42,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:42,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:42,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:42,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:42,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:42,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:42,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:42,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:42,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:42,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:42,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:42,805 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-06 19:01:42,807 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-06 19:01:42,809 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 14 transitions. cyclomatic complexity: 5 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-06 19:01:42,842 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-06 19:01:42,889 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 14 transitions. cyclomatic complexity: 5. 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 31 states and 44 transitions. Complement of second has 7 states. [2025-02-06 19:01:42,890 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-06 19:01:42,891 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-06 19:01:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-02-06 19:01:42,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-06 19:01:42,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:42,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-06 19:01:42,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:42,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2025-02-06 19:01:42,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:42,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2025-02-06 19:01:42,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2025-02-06 19:01:42,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 39 transitions. [2025-02-06 19:01:42,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-02-06 19:01:42,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-06 19:01:42,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2025-02-06 19:01:42,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:42,899 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-02-06 19:01:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2025-02-06 19:01:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2025-02-06 19:01:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 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-06 19:01:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2025-02-06 19:01:42,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 32 transitions. [2025-02-06 19:01:42,902 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2025-02-06 19:01:42,902 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:01:42,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2025-02-06 19:01:42,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-06 19:01:42,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:42,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:42,903 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:01:42,903 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:01:42,903 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-06 19:01:42,903 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-02-06 19:01:42,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:42,903 INFO L85 PathProgramCache]: Analyzing trace with hash 40681, now seen corresponding path program 1 times [2025-02-06 19:01:42,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:42,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140122487] [2025-02-06 19:01:42,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:42,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:01:42,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:01:42,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:42,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:01:42,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:01:42,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:42,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:42,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1167717, now seen corresponding path program 1 times [2025-02-06 19:01:42,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:42,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798621511] [2025-02-06 19:01:42,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:42,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:42,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:42,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:42,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:42,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:42,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:42,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:42,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:42,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1084703667, now seen corresponding path program 1 times [2025-02-06 19:01:42,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:42,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113970208] [2025-02-06 19:01:42,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:42,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:42,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:01:42,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:01:42,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:42,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:42,963 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-06 19:01:42,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:42,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113970208] [2025-02-06 19:01:42,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113970208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:42,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:42,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:01:42,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437126709] [2025-02-06 19:01:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:43,001 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:43,002 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:43,002 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:43,002 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:43,002 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:43,002 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,002 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:43,002 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:43,002 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2025-02-06 19:01:43,002 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:43,002 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:43,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,058 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:43,058 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:43,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:43,063 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-06 19:01:43,064 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-06 19:01:43,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:43,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:43,083 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:43,083 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-06 19:01:43,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:43,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:43,094 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-06 19:01:43,096 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-06 19:01:43,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:43,097 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:43,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 19:01:43,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:43,120 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-06 19:01:43,121 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-06 19:01:43,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:43,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:43,147 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:43,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-06 19:01:43,154 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:43,154 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:43,154 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:43,154 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:43,154 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:43,154 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,154 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:43,155 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:43,155 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2025-02-06 19:01:43,155 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:43,155 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:43,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,215 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:43,215 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:43,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:43,217 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-06 19:01:43,219 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-06 19:01:43,220 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-06 19:01:43,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:43,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:43,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:43,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:43,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:43,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:43,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:43,240 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-06 19:01:43,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:43,242 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-06 19:01:43,244 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-06 19:01:43,245 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-06 19:01:43,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:43,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:43,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:43,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:43,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:43,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:43,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:43,258 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:43,260 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:43,260 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:01:43,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:43,262 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-06 19:01:43,263 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-06 19:01:43,264 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:43,264 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:43,264 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:43,264 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-06 19:01:43,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:43,271 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:43,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:43,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:01:43,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:01:43,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:43,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:43,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:43,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:43,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:43,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:43,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:43,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:43,462 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-06 19:01:43,463 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-06 19:01:43,463 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 32 transitions. cyclomatic complexity: 13 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-06 19:01:43,501 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 32 transitions. cyclomatic complexity: 13. 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 44 states and 65 transitions. Complement of second has 7 states. [2025-02-06 19:01:43,503 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-06 19:01:43,503 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-06 19:01:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-02-06 19:01:43,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-06 19:01:43,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:43,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-06 19:01:43,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:43,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 8 letters. [2025-02-06 19:01:43,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:43,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2025-02-06 19:01:43,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-06 19:01:43,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 35 states and 51 transitions. [2025-02-06 19:01:43,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-06 19:01:43,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-06 19:01:43,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 51 transitions. [2025-02-06 19:01:43,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:43,508 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 51 transitions. [2025-02-06 19:01:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 51 transitions. [2025-02-06 19:01:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2025-02-06 19:01:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5) internal successors, (39), 25 states have internal predecessors, (39), 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-06 19:01:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2025-02-06 19:01:43,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 39 transitions. [2025-02-06 19:01:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:43,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:01:43,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:01:43,511 INFO L87 Difference]: Start difference. First operand 26 states and 39 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-06 19:01:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:43,522 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2025-02-06 19:01:43,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 49 transitions. [2025-02-06 19:01:43,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-02-06 19:01:43,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 46 transitions. [2025-02-06 19:01:43,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-02-06 19:01:43,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-02-06 19:01:43,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 46 transitions. [2025-02-06 19:01:43,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:43,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 46 transitions. [2025-02-06 19:01:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 46 transitions. [2025-02-06 19:01:43,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-02-06 19:01:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 states have internal predecessors, (39), 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-06 19:01:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2025-02-06 19:01:43,525 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-02-06 19:01:43,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:01:43,530 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-02-06 19:01:43,530 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:01:43,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 39 transitions. [2025-02-06 19:01:43,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-02-06 19:01:43,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:43,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:43,531 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:01:43,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:01:43,531 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 main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-02-06 19:01:43,531 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-02-06 19:01:43,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:43,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1261118, now seen corresponding path program 1 times [2025-02-06 19:01:43,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:43,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707780797] [2025-02-06 19:01:43,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:43,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:43,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:43,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:43,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:43,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:43,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:43,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:43,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:43,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:43,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1106397, now seen corresponding path program 1 times [2025-02-06 19:01:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:43,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561550124] [2025-02-06 19:01:43,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:43,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:43,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:43,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:43,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:43,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:43,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:43,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:43,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:43,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash 733002138, now seen corresponding path program 1 times [2025-02-06 19:01:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:43,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809564543] [2025-02-06 19:01:43,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:43,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:01:43,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:01:43,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:43,596 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-06 19:01:43,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:43,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809564543] [2025-02-06 19:01:43,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809564543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:43,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:43,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:01:43,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829879801] [2025-02-06 19:01:43,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:43,623 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:43,623 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:43,623 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:43,623 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:43,623 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:43,623 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,623 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:43,623 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:43,623 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2025-02-06 19:01:43,623 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:43,623 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:43,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,666 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:43,666 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:43,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:43,668 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-06 19:01:43,669 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-06 19:01:43,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:43,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:43,687 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-06 19:01:43,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:43,690 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-06 19:01:43,692 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-06 19:01:43,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:43,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:43,707 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:43,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:43,716 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:43,716 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:43,716 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:43,716 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:43,716 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:43,716 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,716 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:43,716 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:43,716 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2025-02-06 19:01:43,716 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:43,716 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:43,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,771 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:43,771 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:43,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:43,774 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-06 19:01:43,775 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-06 19:01:43,777 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-06 19:01:43,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:43,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:43,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:43,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:43,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:43,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:43,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:43,790 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:43,791 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-06 19:01:43,791 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:01:43,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:43,793 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-06 19:01:43,797 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-06 19:01:43,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:43,797 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:43,797 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:43,797 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-06 19:01:43,804 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-06 19:01:43,805 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:43,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:43,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:43,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:43,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:43,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:43,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:43,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:43,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:43,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:43,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:43,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:43,882 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-06 19:01:43,882 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-06 19:01:43,882 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 39 transitions. cyclomatic complexity: 15 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-06 19:01:43,901 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 39 transitions. cyclomatic complexity: 15. 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 48 states and 71 transitions. Complement of second has 7 states. [2025-02-06 19:01:43,902 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-06 19:01:43,902 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-06 19:01:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-02-06 19:01:43,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-06 19:01:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:43,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-06 19:01:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:43,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 8 letters. [2025-02-06 19:01:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:43,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 71 transitions. [2025-02-06 19:01:43,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2025-02-06 19:01:43,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 44 states and 64 transitions. [2025-02-06 19:01:43,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-02-06 19:01:43,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-02-06 19:01:43,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 64 transitions. [2025-02-06 19:01:43,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:43,904 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 64 transitions. [2025-02-06 19:01:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 64 transitions. [2025-02-06 19:01:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-02-06 19:01:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 42 states have internal predecessors, (63), 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-06 19:01:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2025-02-06 19:01:43,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 63 transitions. [2025-02-06 19:01:43,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:43,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:01:43,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:01:43,911 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. 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-06 19:01:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:43,925 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2025-02-06 19:01:43,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 61 transitions. [2025-02-06 19:01:43,925 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-02-06 19:01:43,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 61 transitions. [2025-02-06 19:01:43,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-02-06 19:01:43,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-02-06 19:01:43,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 61 transitions. [2025-02-06 19:01:43,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:43,926 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 61 transitions. [2025-02-06 19:01:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 61 transitions. [2025-02-06 19:01:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-02-06 19:01:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 41 states have internal predecessors, (59), 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-06 19:01:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2025-02-06 19:01:43,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-02-06 19:01:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:01:43,928 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-02-06 19:01:43,928 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:01:43,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 59 transitions. [2025-02-06 19:01:43,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2025-02-06 19:01:43,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:43,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:43,929 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:01:43,929 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:01:43,929 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 !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-02-06 19:01:43,929 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-02-06 19:01:43,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:43,929 INFO L85 PathProgramCache]: Analyzing trace with hash 39094695, now seen corresponding path program 1 times [2025-02-06 19:01:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:43,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351376974] [2025-02-06 19:01:43,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:43,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:01:43,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:01:43,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:43,934 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:43,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:01:43,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:01:43,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:43,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:43,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1051588, now seen corresponding path program 1 times [2025-02-06 19:01:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:43,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096256798] [2025-02-06 19:01:43,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:43,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:43,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:43,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:43,940 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:43,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:43,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:43,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:43,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:43,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1276858986, now seen corresponding path program 1 times [2025-02-06 19:01:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:43,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689641546] [2025-02-06 19:01:43,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:43,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:01:43,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:01:43,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:43,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:43,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:01:43,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:01:43,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:43,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:43,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:43,992 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:43,992 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:43,992 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:43,992 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:43,992 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:43,993 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:43,993 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:43,993 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:43,993 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2025-02-06 19:01:43,993 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:43,993 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:43,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:43,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,033 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:44,033 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:44,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,037 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-06 19:01:44,038 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-06 19:01:44,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:44,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:44,056 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:44,057 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-06 19:01:44,063 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-06 19:01:44,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,065 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-06 19:01:44,066 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-06 19:01:44,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:44,068 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:44,085 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:44,085 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-06 19:01:44,091 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-06 19:01:44,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,093 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-06 19:01:44,094 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-06 19:01:44,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:44,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:44,111 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-06 19:01:44,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,113 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-06 19:01:44,114 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-06 19:01:44,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:44,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:44,175 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:44,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 19:01:44,180 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:44,180 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:44,180 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:44,180 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:44,180 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:44,180 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,180 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:44,180 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:44,180 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2025-02-06 19:01:44,180 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:44,180 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:44,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,232 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-06 19:01:44,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:44,245 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:44,245 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:44,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,247 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-06 19:01:44,249 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-06 19:01:44,250 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-06 19:01:44,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:44,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:44,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:44,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:44,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:44,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:44,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:44,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:44,266 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-06 19:01:44,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,270 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-06 19:01:44,272 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-06 19:01:44,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-06 19:01:44,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:44,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:44,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:44,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:44,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:44,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:44,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:44,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:44,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,295 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-06 19:01:44,298 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-06 19:01:44,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:44,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:44,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:44,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:44,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:44,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:44,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:44,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:44,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:44,317 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-06 19:01:44,317 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:01:44,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,319 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-06 19:01:44,320 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-06 19:01:44,321 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:44,321 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:44,321 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:44,321 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-06 19:01:44,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-06 19:01:44,328 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:44,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:44,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:01:44,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:01:44,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:44,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:44,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:44,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:44,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:44,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:44,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:44,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:44,384 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-06 19:01:44,387 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-06 19:01:44,387 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 59 transitions. cyclomatic complexity: 22 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-06 19:01:44,416 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 59 transitions. cyclomatic complexity: 22. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 86 states and 121 transitions. Complement of second has 7 states. [2025-02-06 19:01:44,417 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-06 19:01:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-06 19:01:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-02-06 19:01:44,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-06 19:01:44,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:44,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-06 19:01:44,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:44,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 5 letters. Loop has 8 letters. [2025-02-06 19:01:44,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:44,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 121 transitions. [2025-02-06 19:01:44,419 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-02-06 19:01:44,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 78 states and 109 transitions. [2025-02-06 19:01:44,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2025-02-06 19:01:44,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-02-06 19:01:44,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 109 transitions. [2025-02-06 19:01:44,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:44,419 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 109 transitions. [2025-02-06 19:01:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 109 transitions. [2025-02-06 19:01:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2025-02-06 19:01:44,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.453125) internal successors, (93), 63 states have internal predecessors, (93), 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-06 19:01:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2025-02-06 19:01:44,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 93 transitions. [2025-02-06 19:01:44,429 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 93 transitions. [2025-02-06 19:01:44,429 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:01:44,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 93 transitions. [2025-02-06 19:01:44,429 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-02-06 19:01:44,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:44,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:44,435 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:44,435 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:01:44,435 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 !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-02-06 19:01:44,435 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-02-06 19:01:44,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1211935518, now seen corresponding path program 1 times [2025-02-06 19:01:44,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:44,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196264752] [2025-02-06 19:01:44,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:44,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:44,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:44,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:44,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:44,461 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-06 19:01:44,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:44,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196264752] [2025-02-06 19:01:44,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196264752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:44,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:44,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:01:44,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106143729] [2025-02-06 19:01:44,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:44,461 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:44,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1199487, now seen corresponding path program 1 times [2025-02-06 19:01:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:44,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023431416] [2025-02-06 19:01:44,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:44,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:44,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:44,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:44,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:44,478 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-06 19:01:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:44,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023431416] [2025-02-06 19:01:44,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023431416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:44,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:44,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:01:44,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153220640] [2025-02-06 19:01:44,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:44,479 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:44,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:44,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:01:44,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:01:44,479 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. cyclomatic complexity: 37 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-06 19:01:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:44,484 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2025-02-06 19:01:44,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 76 transitions. [2025-02-06 19:01:44,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-02-06 19:01:44,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 51 states and 67 transitions. [2025-02-06 19:01:44,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-02-06 19:01:44,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-02-06 19:01:44,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2025-02-06 19:01:44,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:44,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 67 transitions. [2025-02-06 19:01:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2025-02-06 19:01:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2025-02-06 19:01:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 43 states have internal predecessors, (57), 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-06 19:01:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2025-02-06 19:01:44,487 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 57 transitions. [2025-02-06 19:01:44,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:01:44,488 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2025-02-06 19:01:44,488 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:01:44,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 57 transitions. [2025-02-06 19:01:44,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-02-06 19:01:44,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:44,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:44,488 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:44,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:01:44,489 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 main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-02-06 19:01:44,489 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-02-06 19:01:44,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:44,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1248229834, now seen corresponding path program 1 times [2025-02-06 19:01:44,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:44,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228232478] [2025-02-06 19:01:44,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:44,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:44,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:01:44,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:01:44,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:44,508 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-06 19:01:44,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228232478] [2025-02-06 19:01:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228232478] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119275228] [2025-02-06 19:01:44,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:44,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,510 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-06 19:01:44,511 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-06 19:01:44,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:01:44,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:01:44,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:44,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:01:44,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:44,538 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-06 19:01:44,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:44,553 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-06 19:01:44,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119275228] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:44,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:44,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-06 19:01:44,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448296674] [2025-02-06 19:01:44,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:44,554 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:44,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1021796, now seen corresponding path program 2 times [2025-02-06 19:01:44,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:44,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664520058] [2025-02-06 19:01:44,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:44,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:44,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:44,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:44,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:01:44,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:44,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:44,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:44,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:44,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:44,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:44,592 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:44,592 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:44,592 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:44,592 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:44,592 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:44,592 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,592 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:44,592 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:44,592 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2025-02-06 19:01:44,592 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:44,592 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:44,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,632 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:44,632 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:44,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,638 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-06 19:01:44,640 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-06 19:01:44,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:44,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:44,667 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-06 19:01:44,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,673 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-06 19:01:44,673 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-06 19:01:44,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:44,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:44,694 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:44,698 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-06 19:01:44,698 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:44,698 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:44,698 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:44,698 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:44,699 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:44,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:44,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:44,699 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2025-02-06 19:01:44,699 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:44,699 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:44,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,747 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:44,748 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:44,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,752 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-06 19:01:44,757 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-06 19:01:44,758 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-06 19:01:44,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:44,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:44,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:44,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:44,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:44,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:44,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:44,773 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:44,775 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:44,775 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:01:44,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:44,778 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-06 19:01:44,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-06 19:01:44,780 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:44,780 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:44,780 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:44,780 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-06 19:01:44,786 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-06 19:01:44,786 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:44,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:44,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:01:44,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:01:44,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:44,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:44,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:44,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:44,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:44,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:44,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:44,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:44,821 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-06 19:01:44,821 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-06 19:01:44,822 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 57 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 19:01:44,856 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 57 transitions. cyclomatic complexity: 19. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 107 states and 135 transitions. Complement of second has 7 states. [2025-02-06 19:01:44,857 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-06 19:01:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 19:01:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-02-06 19:01:44,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-06 19:01:44,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:44,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2025-02-06 19:01:44,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:44,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 8 letters. [2025-02-06 19:01:44,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:44,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 135 transitions. [2025-02-06 19:01:44,859 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2025-02-06 19:01:44,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 100 states and 127 transitions. [2025-02-06 19:01:44,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-02-06 19:01:44,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-02-06 19:01:44,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 127 transitions. [2025-02-06 19:01:44,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:44,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 127 transitions. [2025-02-06 19:01:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 127 transitions. [2025-02-06 19:01:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2025-02-06 19:01:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 87 states have internal predecessors, (115), 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-06 19:01:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2025-02-06 19:01:44,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 115 transitions. [2025-02-06 19:01:44,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:44,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:01:44,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:01:44,862 INFO L87 Difference]: Start difference. First operand 88 states and 115 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-06 19:01:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:44,905 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2025-02-06 19:01:44,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 184 transitions. [2025-02-06 19:01:44,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-02-06 19:01:44,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2025-02-06 19:01:44,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2025-02-06 19:01:44,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-02-06 19:01:44,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2025-02-06 19:01:44,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:44,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 140 transitions. [2025-02-06 19:01:44,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2025-02-06 19:01:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2025-02-06 19:01:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 94 states have internal predecessors, (112), 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-06 19:01:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2025-02-06 19:01:44,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 112 transitions. [2025-02-06 19:01:44,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:01:44,911 INFO L432 stractBuchiCegarLoop]: Abstraction has 95 states and 112 transitions. [2025-02-06 19:01:44,911 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:01:44,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 112 transitions. [2025-02-06 19:01:44,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2025-02-06 19:01:44,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:44,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:44,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:44,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:01:44,912 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 !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-06 19:01:44,912 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-06 19:01:44,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash 927922874, now seen corresponding path program 1 times [2025-02-06 19:01:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:44,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942754489] [2025-02-06 19:01:44,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:44,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:01:44,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:01:44,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:44,915 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:44,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:01:44,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:01:44,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:44,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:44,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1199517, now seen corresponding path program 2 times [2025-02-06 19:01:44,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:44,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953679300] [2025-02-06 19:01:44,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:44,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:44,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:44,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:44,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:01:44,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:44,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:44,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:44,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:44,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:44,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:44,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1383906346, now seen corresponding path program 2 times [2025-02-06 19:01:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567686324] [2025-02-06 19:01:44,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:44,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 19:01:44,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:01:44,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:44,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:44,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:44,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:01:44,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:01:44,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:44,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:44,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:44,974 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:44,974 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:44,974 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:44,974 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:44,974 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:44,974 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:44,974 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:44,974 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:44,974 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2025-02-06 19:01:44,974 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:44,974 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:44,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:44,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:45,014 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:45,014 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:45,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:45,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:45,016 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-06 19:01:45,020 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-06 19:01:45,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:45,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:45,037 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-06 19:01:45,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:45,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:45,039 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-06 19:01:45,040 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-06 19:01:45,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:45,042 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:45,053 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:45,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-06 19:01:45,063 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:45,063 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:45,063 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:45,063 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:45,063 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:45,063 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:45,063 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:45,063 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:45,063 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2025-02-06 19:01:45,063 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:45,063 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:45,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:45,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:45,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:45,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:45,095 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:45,095 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:45,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:45,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:45,097 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-06 19:01:45,098 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-06 19:01:45,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-06 19:01:45,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:45,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:45,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:45,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:45,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:45,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:45,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:45,115 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:45,117 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:45,117 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:01:45,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:45,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:45,120 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-06 19:01:45,121 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-06 19:01:45,121 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:45,121 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:45,121 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:45,121 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-06 19:01:45,127 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-06 19:01:45,128 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:45,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:45,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:01:45,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:01:45,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:45,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:45,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:45,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:45,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:45,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:45,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:45,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:45,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:45,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:45,206 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-06 19:01:45,207 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-06 19:01:45,207 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 112 transitions. cyclomatic complexity: 26 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 19:01:45,242 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 112 transitions. cyclomatic complexity: 26. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 130 states and 154 transitions. Complement of second has 7 states. [2025-02-06 19:01:45,244 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-06 19:01:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 19:01:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-02-06 19:01:45,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2025-02-06 19:01:45,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:45,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2025-02-06 19:01:45,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:45,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2025-02-06 19:01:45,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:45,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 154 transitions. [2025-02-06 19:01:45,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-02-06 19:01:45,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 108 states and 129 transitions. [2025-02-06 19:01:45,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2025-02-06 19:01:45,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-02-06 19:01:45,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 129 transitions. [2025-02-06 19:01:45,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:45,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 129 transitions. [2025-02-06 19:01:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 129 transitions. [2025-02-06 19:01:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2025-02-06 19:01:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.184782608695652) internal successors, (109), 91 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-06 19:01:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2025-02-06 19:01:45,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 109 transitions. [2025-02-06 19:01:45,260 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 109 transitions. [2025-02-06 19:01:45,260 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:01:45,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 109 transitions. [2025-02-06 19:01:45,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-02-06 19:01:45,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:45,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:45,261 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 2, 1, 1, 1, 1] [2025-02-06 19:01:45,261 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2025-02-06 19:01:45,265 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 main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-02-06 19:01:45,266 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-02-06 19:01:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2032595474, now seen corresponding path program 1 times [2025-02-06 19:01:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114780862] [2025-02-06 19:01:45,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:45,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:45,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:01:45,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:01:45,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:45,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:45,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-06 19:01:45,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 19:01:45,366 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-06 19:01:45,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114780862] [2025-02-06 19:01:45,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114780862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:45,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:45,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:01:45,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775137663] [2025-02-06 19:01:45,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:45,366 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:45,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1113477169, now seen corresponding path program 1 times [2025-02-06 19:01:45,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:45,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653470208] [2025-02-06 19:01:45,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:45,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:45,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 19:01:45,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:01:45,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:45,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:45,377 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-06 19:01:45,405 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-06 19:01:45,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:45,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653470208] [2025-02-06 19:01:45,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653470208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:45,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:45,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:01:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192042947] [2025-02-06 19:01:45,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:45,406 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:45,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:45,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:01:45,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:01:45,406 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. cyclomatic complexity: 25 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-06 19:01:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:45,420 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2025-02-06 19:01:45,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 117 transitions. [2025-02-06 19:01:45,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2025-02-06 19:01:45,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 101 states and 115 transitions. [2025-02-06 19:01:45,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2025-02-06 19:01:45,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2025-02-06 19:01:45,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 115 transitions. [2025-02-06 19:01:45,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:45,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 115 transitions. [2025-02-06 19:01:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 115 transitions. [2025-02-06 19:01:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2025-02-06 19:01:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 91 states have internal predecessors, (106), 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-06 19:01:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2025-02-06 19:01:45,427 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 106 transitions. [2025-02-06 19:01:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:01:45,431 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 106 transitions. [2025-02-06 19:01:45,431 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:01:45,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 106 transitions. [2025-02-06 19:01:45,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-02-06 19:01:45,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:45,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:45,432 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1, 1] [2025-02-06 19:01:45,432 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2025-02-06 19:01:45,432 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 main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-02-06 19:01:45,432 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-02-06 19:01:45,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash 917849354, now seen corresponding path program 2 times [2025-02-06 19:01:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:45,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545485486] [2025-02-06 19:01:45,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:45,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:45,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 19:01:45,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:01:45,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:45,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:45,490 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-06 19:01:45,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:45,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545485486] [2025-02-06 19:01:45,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545485486] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:45,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343410697] [2025-02-06 19:01:45,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:45,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:45,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:45,493 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-06 19:01:45,496 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-06 19:01:45,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 19:01:45,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:01:45,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:45,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:45,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:01:45,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:45,535 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-06 19:01:45,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:45,583 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-06 19:01:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343410697] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:45,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:45,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-06 19:01:45,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303194010] [2025-02-06 19:01:45,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:45,584 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:45,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1299819981, now seen corresponding path program 2 times [2025-02-06 19:01:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:45,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735210317] [2025-02-06 19:01:45,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:45,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:45,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 19:01:45,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:01:45,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:45,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:45,614 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-06 19:01:45,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:45,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735210317] [2025-02-06 19:01:45,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735210317] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:45,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098445066] [2025-02-06 19:01:45,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:45,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:45,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:45,616 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-06 19:01:45,617 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-06 19:01:45,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 19:01:45,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:01:45,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:45,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:45,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:45,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:45,652 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-06 19:01:45,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:45,671 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-06 19:01:45,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098445066] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:45,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:45,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 19:01:45,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228322641] [2025-02-06 19:01:45,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:45,672 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:45,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:45,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:01:45,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:01:45,672 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. cyclomatic complexity: 22 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-06 19:01:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:45,700 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2025-02-06 19:01:45,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 171 transitions. [2025-02-06 19:01:45,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2025-02-06 19:01:45,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 148 states and 163 transitions. [2025-02-06 19:01:45,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-02-06 19:01:45,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-02-06 19:01:45,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 163 transitions. [2025-02-06 19:01:45,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:45,702 INFO L218 hiAutomatonCegarLoop]: Abstraction has 148 states and 163 transitions. [2025-02-06 19:01:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 163 transitions. [2025-02-06 19:01:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2025-02-06 19:01:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.1007194244604317) internal successors, (153), 138 states have internal predecessors, (153), 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-06 19:01:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2025-02-06 19:01:45,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 139 states and 153 transitions. [2025-02-06 19:01:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 19:01:45,705 INFO L432 stractBuchiCegarLoop]: Abstraction has 139 states and 153 transitions. [2025-02-06 19:01:45,705 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:01:45,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 153 transitions. [2025-02-06 19:01:45,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2025-02-06 19:01:45,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:45,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:45,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 9, 9, 6, 4, 2, 1, 1, 1] [2025-02-06 19:01:45,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 6, 4, 1, 1] [2025-02-06 19:01:45,706 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 main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-02-06 19:01:45,706 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-02-06 19:01:45,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1813173626, now seen corresponding path program 3 times [2025-02-06 19:01:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:45,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718520310] [2025-02-06 19:01:45,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:45,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:45,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-02-06 19:01:45,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 36 of 44 statements. [2025-02-06 19:01:45,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-06 19:01:45,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:45,770 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-06 19:01:45,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718520310] [2025-02-06 19:01:45,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718520310] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930459853] [2025-02-06 19:01:45,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:45,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:45,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:45,772 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-06 19:01:45,773 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-06 19:01:45,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-02-06 19:01:45,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 36 of 44 statements. [2025-02-06 19:01:45,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-06 19:01:45,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:45,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:01:45,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:45,837 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-06 19:01:45,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:45,965 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-06 19:01:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930459853] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:45,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:45,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-02-06 19:01:45,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863165024] [2025-02-06 19:01:45,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:45,969 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:45,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash -294954947, now seen corresponding path program 3 times [2025-02-06 19:01:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092173289] [2025-02-06 19:01:45,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:45,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:45,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 10 equivalence classes. [2025-02-06 19:01:45,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 32 of 40 statements. [2025-02-06 19:01:45,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-06 19:01:45,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:46,087 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-06 19:01:46,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:46,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092173289] [2025-02-06 19:01:46,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092173289] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:46,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410943470] [2025-02-06 19:01:46,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:46,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:46,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:46,089 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-06 19:01:46,091 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-06 19:01:46,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 10 equivalence classes. [2025-02-06 19:01:46,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 32 of 40 statements. [2025-02-06 19:01:46,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-06 19:01:46,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:46,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:01:46,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:46,149 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-06 19:01:46,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:46,215 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-06 19:01:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410943470] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:46,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-02-06 19:01:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323434335] [2025-02-06 19:01:46,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:46,216 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:46,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 19:01:46,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-06 19:01:46,217 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. cyclomatic complexity: 22 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-06 19:01:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:46,279 INFO L93 Difference]: Finished difference Result 324 states and 360 transitions. [2025-02-06 19:01:46,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 324 states and 360 transitions. [2025-02-06 19:01:46,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-02-06 19:01:46,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 324 states to 313 states and 349 transitions. [2025-02-06 19:01:46,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2025-02-06 19:01:46,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 229 [2025-02-06 19:01:46,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 313 states and 349 transitions. [2025-02-06 19:01:46,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:46,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 313 states and 349 transitions. [2025-02-06 19:01:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states and 349 transitions. [2025-02-06 19:01:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 285. [2025-02-06 19:01:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 285 states have (on average 1.1263157894736842) internal successors, (321), 284 states have internal predecessors, (321), 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-06 19:01:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 321 transitions. [2025-02-06 19:01:46,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 285 states and 321 transitions. [2025-02-06 19:01:46,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:01:46,288 INFO L432 stractBuchiCegarLoop]: Abstraction has 285 states and 321 transitions. [2025-02-06 19:01:46,288 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:01:46,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 285 states and 321 transitions. [2025-02-06 19:01:46,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-02-06 19:01:46,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:46,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:46,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 14, 13, 10, 4, 1, 1, 1, 1] [2025-02-06 19:01:46,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2025-02-06 19:01:46,291 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 !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-02-06 19:01:46,291 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-02-06 19:01:46,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:46,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1518427413, now seen corresponding path program 4 times [2025-02-06 19:01:46,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:46,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492908848] [2025-02-06 19:01:46,291 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:46,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:46,295 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-02-06 19:01:46,298 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 19:01:46,299 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:01:46,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:46,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:46,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 19:01:46,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 19:01:46,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:46,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:46,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:46,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1202320293, now seen corresponding path program 4 times [2025-02-06 19:01:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:46,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902012674] [2025-02-06 19:01:46,310 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:46,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:46,317 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-02-06 19:01:46,326 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 19:01:46,326 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:01:46,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:46,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:46,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 19:01:46,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 19:01:46,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:46,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:46,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:46,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1456911547, now seen corresponding path program 5 times [2025-02-06 19:01:46,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:46,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528868883] [2025-02-06 19:01:46,344 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:01:46,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:46,350 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 140 statements into 35 equivalence classes. [2025-02-06 19:01:46,353 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 36 of 140 statements. [2025-02-06 19:01:46,353 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-02-06 19:01:46,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1343 proven. 28 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2025-02-06 19:01:46,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528868883] [2025-02-06 19:01:46,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528868883] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942145197] [2025-02-06 19:01:46,392 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:01:46,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:46,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:46,396 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-06 19:01:46,396 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-06 19:01:46,421 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 140 statements into 35 equivalence classes. [2025-02-06 19:01:46,429 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 36 of 140 statements. [2025-02-06 19:01:46,430 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-02-06 19:01:46,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:46,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:01:46,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1343 proven. 28 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2025-02-06 19:01:46,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1343 proven. 28 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2025-02-06 19:01:46,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942145197] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:46,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:46,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-06 19:01:46,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728215970] [2025-02-06 19:01:46,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:46,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 19:01:46,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-06 19:01:46,888 INFO L87 Difference]: Start difference. First operand 285 states and 321 transitions. cyclomatic complexity: 41 Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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-06 19:01:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:46,949 INFO L93 Difference]: Finished difference Result 299 states and 314 transitions. [2025-02-06 19:01:46,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 299 states and 314 transitions. [2025-02-06 19:01:46,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-02-06 19:01:46,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 299 states to 285 states and 300 transitions. [2025-02-06 19:01:46,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2025-02-06 19:01:46,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2025-02-06 19:01:46,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 300 transitions. [2025-02-06 19:01:46,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:46,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 285 states and 300 transitions. [2025-02-06 19:01:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 300 transitions. [2025-02-06 19:01:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 165. [2025-02-06 19:01:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 1.0787878787878789) internal successors, (178), 164 states have internal predecessors, (178), 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-06 19:01:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2025-02-06 19:01:46,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 178 transitions. [2025-02-06 19:01:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:01:46,956 INFO L432 stractBuchiCegarLoop]: Abstraction has 165 states and 178 transitions. [2025-02-06 19:01:46,956 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:01:46,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 178 transitions. [2025-02-06 19:01:46,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-02-06 19:01:46,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:46,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:46,958 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:01:46,958 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2025-02-06 19:01:46,958 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 !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-02-06 19:01:46,958 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-02-06 19:01:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1275905674, now seen corresponding path program 1 times [2025-02-06 19:01:46,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:46,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644678183] [2025-02-06 19:01:46,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:46,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:46,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:01:46,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:01:46,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:46,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:46,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:46,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:01:46,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:01:46,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:46,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:46,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:46,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1298120217, now seen corresponding path program 5 times [2025-02-06 19:01:46,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:46,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390959539] [2025-02-06 19:01:46,967 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:01:46,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:46,970 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 80 statements into 20 equivalence classes. [2025-02-06 19:01:46,975 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 19:01:46,976 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-02-06 19:01:46,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:46,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:46,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 19:01:46,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 19:01:46,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:46,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:46,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:46,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:46,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2100848, now seen corresponding path program 6 times [2025-02-06 19:01:46,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:46,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136838046] [2025-02-06 19:01:46,999 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:01:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:47,004 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 89 statements into 22 equivalence classes. [2025-02-06 19:01:47,011 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 19:01:47,011 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2025-02-06 19:01:47,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:47,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:47,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 19:01:47,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 19:01:47,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:47,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:47,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:47,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:01:47,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:01:47,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:47,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:47,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:47,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:01:47,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:01:47,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:47,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:47,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:01:47 BoogieIcfgContainer [2025-02-06 19:01:47,497 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:01:47,497 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:01:47,497 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:01:47,497 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:01:47,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:01:42" (3/4) ... [2025-02-06 19:01:47,499 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-06 19:01:47,539 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 19:01:47,539 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:01:47,540 INFO L158 Benchmark]: Toolchain (without parser) took 5785.26ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 105.7MB in the end (delta: 7.1MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2025-02-06 19:01:47,540 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:47,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 125.56ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 102.7MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:47,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.88ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.8MB in the end (delta: 896.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:47,541 INFO L158 Benchmark]: Boogie Preprocessor took 13.63ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.9MB in the end (delta: 925.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:47,541 INFO L158 Benchmark]: IcfgBuilder took 141.83ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 91.4MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:47,541 INFO L158 Benchmark]: BuchiAutomizer took 5443.31ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 109.9MB in the end (delta: -18.5MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2025-02-06 19:01:47,541 INFO L158 Benchmark]: Witness Printer took 41.59ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 105.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:47,542 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 125.56ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 102.7MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.88ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.8MB in the end (delta: 896.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.63ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.9MB in the end (delta: 925.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 141.83ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 91.4MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5443.31ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 109.9MB in the end (delta: -18.5MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. * Witness Printer took 41.59ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 105.7MB in the end (delta: 4.2MB). 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 15 terminating modules (9 trivial, 6 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. 9 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 165 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 13 iterations. TraceHistogramMax:20. Analysis of lassos took 4.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 262 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 [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 458 IncrementalHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 109 mSDtfsCounter, 458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT3 conc1 concLT2 SILN0 SILU0 SILI4 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax182 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq173 hnf91 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 18]: 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=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] Loop: [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 [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) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 18]: 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=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] Loop: [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 [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) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-06 19:01:47,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-02-06 19:01:47,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-02-06 19:01:47,961 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-06 19:01:48,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:48,361 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-06 19:01:48,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:48,767 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)