./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:18:29,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:18:29,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:18:29,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:18:29,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:18:29,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:18:29,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:18:29,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:18:29,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:18:29,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:18:29,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:18:29,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:18:29,904 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:18:29,904 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:18:29,904 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:18:29,904 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:18:29,905 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:18:29,905 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:18:29,905 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:18:29,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:18:29,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:18:29,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:18:29,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:18:29,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:18:29,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:18:29,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:18:29,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:18:29,911 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:18:29,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:18:29,911 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:18:29,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:18:29,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:18:29,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:18:29,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:18:29,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:18:29,913 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:18:29,913 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a [2024-11-09 15:18:30,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:18:30,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:18:30,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:18:30,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:18:30,136 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:18:30,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2024-11-09 15:18:31,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:18:31,635 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:18:31,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2024-11-09 15:18:31,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2418a86e3/fd196ed227d046aba3b431a1be53e3aa/FLAGd3e9da4d1 [2024-11-09 15:18:31,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2418a86e3/fd196ed227d046aba3b431a1be53e3aa [2024-11-09 15:18:31,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:18:31,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:18:31,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:18:31,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:18:31,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:18:31,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4083e444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31, skipping insertion in model container [2024-11-09 15:18:31,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:18:31,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:18:31,815 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:18:31,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:18:31,841 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:18:31,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31 WrapperNode [2024-11-09 15:18:31,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:18:31,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:18:31,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:18:31,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:18:31,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,864 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 10 [2024-11-09 15:18:31,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:18:31,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:18:31,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:18:31,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:18:31,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,878 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 15:18:31,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:18:31,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:18:31,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:18:31,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:18:31,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (1/1) ... [2024-11-09 15:18:31,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:31,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:31,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:31,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:18:31,963 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2024-11-09 15:18:31,964 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2024-11-09 15:18:31,964 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2024-11-09 15:18:31,964 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2024-11-09 15:18:31,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:18:31,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:18:32,014 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:18:32,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:18:32,104 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-09 15:18:32,104 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:18:32,123 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:18:32,124 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 15:18:32,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:18:32 BoogieIcfgContainer [2024-11-09 15:18:32,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:18:32,125 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:18:32,125 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:18:32,137 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:18:32,139 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:18:32,139 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:18:31" (1/3) ... [2024-11-09 15:18:32,140 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cec541b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:18:32, skipping insertion in model container [2024-11-09 15:18:32,140 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:18:32,140 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:31" (2/3) ... [2024-11-09 15:18:32,141 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cec541b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:18:32, skipping insertion in model container [2024-11-09 15:18:32,141 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:18:32,141 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:18:32" (3/3) ... [2024-11-09 15:18:32,142 INFO L332 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1a-2.c [2024-11-09 15:18:32,207 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:18:32,207 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:18:32,207 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:18:32,207 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:18:32,207 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:18:32,208 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:18:32,208 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:18:32,208 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:18:32,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 15:18:32,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-09 15:18:32,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:32,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:32,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:18:32,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:18:32,234 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:18:32,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 15:18:32,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-09 15:18:32,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:32,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:32,239 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:18:32,239 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:18:32,246 INFO L745 eck$LassoCheckResult]: Stem: 21#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;havoc main_#t~nondet5#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 13#L26true assume !!(main_~x~0#1 <= 2147483646); 8#L27true call main_#t~ret6#1 := rec2(main_~x~0#1);< 7#$Ultimate##0true [2024-11-09 15:18:32,246 INFO L747 eck$LassoCheckResult]: Loop: 7#$Ultimate##0true ~j := #in~j; 17#L18true assume !(~j <= 0); 20#L20true call #t~ret3 := rec1(1 + ~j);< 4#$Ultimate##0true ~i := #in~i; 18#L12true assume ~i <= 0;#res := 0; 15#rec1FINALtrue assume true; 16#rec1EXITtrue >#39#return; 3#L20-1true call #t~ret4 := rec2(#t~ret3);< 7#$Ultimate##0true [2024-11-09 15:18:32,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:32,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1510579, now seen corresponding path program 1 times [2024-11-09 15:18:32,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:32,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300085137] [2024-11-09 15:18:32,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:32,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:32,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:32,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:32,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:32,336 INFO L85 PathProgramCache]: Analyzing trace with hash -931063642, now seen corresponding path program 1 times [2024-11-09 15:18:32,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:32,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240051058] [2024-11-09 15:18:32,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:32,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:18:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:18:32,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:18:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240051058] [2024-11-09 15:18:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240051058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:18:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:18:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:18:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129490469] [2024-11-09 15:18:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:18:32,503 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:18:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:18:32,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:18:32,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:18:32,535 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:18:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:18:32,607 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2024-11-09 15:18:32,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2024-11-09 15:18:32,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-09 15:18:32,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 24 transitions. [2024-11-09 15:18:32,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-09 15:18:32,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-09 15:18:32,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2024-11-09 15:18:32,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:18:32,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-09 15:18:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2024-11-09 15:18:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-09 15:18:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 15:18:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-11-09 15:18:32,640 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-09 15:18:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:18:32,644 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-09 15:18:32,644 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:18:32,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2024-11-09 15:18:32,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-09 15:18:32,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:32,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:32,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:18:32,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:18:32,648 INFO L745 eck$LassoCheckResult]: Stem: 81#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 78#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;havoc main_#t~nondet5#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 77#L26 assume !!(main_~x~0#1 <= 2147483646); 66#L27 call main_#t~ret6#1 := rec2(main_~x~0#1);< 67#$Ultimate##0 [2024-11-09 15:18:32,649 INFO L747 eck$LassoCheckResult]: Loop: 67#$Ultimate##0 ~j := #in~j; 74#L18 assume !(~j <= 0); 69#L20 call #t~ret3 := rec1(1 + ~j);< 68#$Ultimate##0 ~i := #in~i; 73#L12 assume !(~i <= 0); 70#L14 call #t~ret0 := rec1(~i - 2);< 68#$Ultimate##0 ~i := #in~i; 73#L12 assume ~i <= 0;#res := 0; 79#rec1FINAL assume true; 80#rec1EXIT >#33#return; 71#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 68#$Ultimate##0 ~i := #in~i; 73#L12 assume ~i <= 0;#res := 0; 79#rec1FINAL assume true; 80#rec1EXIT >#35#return; 72#L14-2 call #t~ret2 := rec1(#t~ret1);< 68#$Ultimate##0 ~i := #in~i; 73#L12 assume ~i <= 0;#res := 0; 79#rec1FINAL assume true; 80#rec1EXIT >#37#return; 75#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 76#rec1FINAL assume true; 82#rec1EXIT >#39#return; 65#L20-1 call #t~ret4 := rec2(#t~ret3);< 67#$Ultimate##0 [2024-11-09 15:18:32,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1510579, now seen corresponding path program 2 times [2024-11-09 15:18:32,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:32,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301141802] [2024-11-09 15:18:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:32,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:32,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:32,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:32,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1852060604, now seen corresponding path program 1 times [2024-11-09 15:18:32,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:32,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651881484] [2024-11-09 15:18:32,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:32,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:32,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:32,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:32,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:32,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2035496338, now seen corresponding path program 1 times [2024-11-09 15:18:32,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:32,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323174979] [2024-11-09 15:18:32,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:32,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:32,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:32,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:33,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:33,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:18:33 BoogieIcfgContainer [2024-11-09 15:18:33,133 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:18:33,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:18:33,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:18:33,134 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:18:33,134 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:18:32" (3/4) ... [2024-11-09 15:18:33,136 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:18:33,166 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:18:33,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:18:33,166 INFO L158 Benchmark]: Toolchain (without parser) took 1506.78ms. Allocated memory is still 176.2MB. Free memory was 120.4MB in the beginning and 135.5MB in the end (delta: -15.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:18:33,167 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:18:33,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.78ms. Allocated memory is still 176.2MB. Free memory was 120.4MB in the beginning and 109.2MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:18:33,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.82ms. Allocated memory is still 176.2MB. Free memory was 109.2MB in the beginning and 107.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:18:33,168 INFO L158 Benchmark]: Boogie Preprocessor took 18.40ms. Allocated memory is still 176.2MB. Free memory was 107.8MB in the beginning and 106.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:18:33,168 INFO L158 Benchmark]: RCFGBuilder took 240.03ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 95.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:18:33,168 INFO L158 Benchmark]: BuchiAutomizer took 1007.78ms. Allocated memory is still 176.2MB. Free memory was 95.9MB in the beginning and 137.6MB in the end (delta: -41.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:18:33,169 INFO L158 Benchmark]: Witness Printer took 32.62ms. Allocated memory is still 176.2MB. Free memory was 137.6MB in the beginning and 135.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:18:33,170 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.17ms. Allocated memory is still 176.2MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.78ms. Allocated memory is still 176.2MB. Free memory was 120.4MB in the beginning and 109.2MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.82ms. Allocated memory is still 176.2MB. Free memory was 109.2MB in the beginning and 107.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.40ms. Allocated memory is still 176.2MB. Free memory was 107.8MB in the beginning and 106.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 240.03ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 95.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1007.78ms. Allocated memory is still 176.2MB. Free memory was 95.9MB in the beginning and 137.6MB in the end (delta: -41.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 32.62ms. Allocated memory is still 176.2MB. Free memory was 137.6MB in the beginning and 135.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 2 iterations. TraceHistogramMax:4. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 27 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L24] int x = __VERIFIER_nondet_int(); [L26] COND FALSE !(!(x<=2147483646)) VAL [x=1] [L27] CALL rec2(x) VAL [\old(j)=1] Loop: [L18] COND FALSE !(j <= 0) [L20] CALL, EXPR rec1(j+1) [L12] COND FALSE !(i <= 0) [L14] CALL, EXPR rec1(i-2) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(i-2) [L14] CALL, EXPR rec1(rec1(i-2) - 1) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(rec1(i-2) - 1) [L14] CALL, EXPR rec1(rec1(rec1(i-2) - 1)) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(rec1(rec1(i-2) - 1)) [L14] return rec1(rec1(rec1(i-2) - 1)) + 1; [L20] RET, EXPR rec1(j+1) [L20] CALL rec2(rec1(j+1)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L24] int x = __VERIFIER_nondet_int(); [L26] COND FALSE !(!(x<=2147483646)) VAL [x=1] [L27] CALL rec2(x) VAL [\old(j)=1] Loop: [L18] COND FALSE !(j <= 0) [L20] CALL, EXPR rec1(j+1) [L12] COND FALSE !(i <= 0) [L14] CALL, EXPR rec1(i-2) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(i-2) [L14] CALL, EXPR rec1(rec1(i-2) - 1) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(rec1(i-2) - 1) [L14] CALL, EXPR rec1(rec1(rec1(i-2) - 1)) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(rec1(rec1(i-2) - 1)) [L14] return rec1(rec1(rec1(i-2) - 1)) + 1; [L20] RET, EXPR rec1(j+1) [L20] CALL rec2(rec1(j+1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 15:18:33,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)