./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-25 00:35:22,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:35:22,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:35:22,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:35:22,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:35:22,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:35:22,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:35:22,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:35:22,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:35:22,863 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:35:22,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:35:22,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:35:22,864 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:35:22,864 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:35:22,867 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:35:22,867 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:35:22,867 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:35:22,867 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:35:22,868 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:35:22,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:35:22,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:35:22,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:35:22,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:35:22,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:35:22,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:35:22,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:35:22,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:35:22,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:35:22,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:35:22,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:35:22,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:35:22,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:35:22,875 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:35:22,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:35:22,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:35:22,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:35:22,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:35:22,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:35:22,878 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:35:22,879 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2024-10-25 00:35:23,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:35:23,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:35:23,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:35:23,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:35:23,201 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:35:23,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2024-10-25 00:35:24,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:35:24,907 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:35:24,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2024-10-25 00:35:24,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def6238a0/a9fdb5b45a20420db2572a0c6cb46d6b/FLAGf8e712169 [2024-10-25 00:35:25,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def6238a0/a9fdb5b45a20420db2572a0c6cb46d6b [2024-10-25 00:35:25,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:35:25,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:35:25,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:35:25,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:35:25,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:35:25,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cac6d43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25, skipping insertion in model container [2024-10-25 00:35:25,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:35:25,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:35:25,537 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:35:25,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:35:25,563 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:35:25,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25 WrapperNode [2024-10-25 00:35:25,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:35:25,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:35:25,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:35:25,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:35:25,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,593 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-10-25 00:35:25,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:35:25,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:35:25,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:35:25,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:35:25,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,612 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-25 00:35:25,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:35:25,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:35:25,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:35:25,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:35:25,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:25,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:25,666 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-10-25 00:35:25,670 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-10-25 00:35:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-10-25 00:35:25,711 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-10-25 00:35:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:35:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:35:25,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:35:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:35:25,777 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:35:25,779 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:35:25,889 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-25 00:35:25,889 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:35:25,903 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:35:25,904 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-25 00:35:25,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:35:25 BoogieIcfgContainer [2024-10-25 00:35:25,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:35:25,905 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:35:25,905 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:35:25,909 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:35:25,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:35:25,910 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:35:25" (1/3) ... [2024-10-25 00:35:25,911 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3974ae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:35:25, skipping insertion in model container [2024-10-25 00:35:25,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:35:25,911 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (2/3) ... [2024-10-25 00:35:25,913 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3974ae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:35:25, skipping insertion in model container [2024-10-25 00:35:25,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:35:25,913 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:35:25" (3/3) ... [2024-10-25 00:35:25,915 INFO L332 chiAutomizerObserver]: Analyzing ICFG Fibonacci05.c [2024-10-25 00:35:25,979 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:35:25,979 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:35:25,979 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:35:25,979 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:35:25,979 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:35:25,980 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:35:25,980 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:35:25,980 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:35:25,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-25 00:35:25,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-25 00:35:25,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:25,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:26,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:35:26,004 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:35:26,004 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:35:26,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-25 00:35:26,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-25 00:35:26,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:26,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:26,008 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:35:26,008 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:35:26,015 INFO L745 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 8#L29true call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 14#$Ultimate##0true [2024-10-25 00:35:26,016 INFO L747 eck$LassoCheckResult]: Loop: 14#$Ultimate##0true ~n := #in~n; 4#L17true assume !(~n < 1); 18#L19true assume !(1 == ~n); 16#L22true call #t~ret4 := fibonacci(~n - 1);< 14#$Ultimate##0true [2024-10-25 00:35:26,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:26,022 INFO L85 PathProgramCache]: Analyzing trace with hash 42783, now seen corresponding path program 1 times [2024-10-25 00:35:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:26,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982662708] [2024-10-25 00:35:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:26,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:26,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:26,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 927643, now seen corresponding path program 1 times [2024-10-25 00:35:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124153185] [2024-10-25 00:35:26,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:26,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:26,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:26,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:26,210 INFO L85 PathProgramCache]: Analyzing trace with hash 856297401, now seen corresponding path program 1 times [2024-10-25 00:35:26,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:26,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194343583] [2024-10-25 00:35:26,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:26,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:26,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:26,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:26,351 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:26,352 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:26,352 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:26,352 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:26,352 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:35:26,353 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,353 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:26,353 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:26,355 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration1_Loop [2024-10-25 00:35:26,355 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:26,356 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:26,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,469 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:26,470 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:35:26,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,476 INFO L229 MonitoredProcess]: Starting monitored process 2 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-10-25 00:35:26,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-25 00:35:26,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:26,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:26,498 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:26,499 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:26,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-25 00:35:26,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,512 INFO L229 MonitoredProcess]: Starting monitored process 3 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-10-25 00:35:26,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-25 00:35:26,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:26,514 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:26,531 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:26,531 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret5=0} Honda state: {fibonacci_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:26,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-25 00:35:26,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,549 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10-25 00:35:26,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-25 00:35:26,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:26,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:26,567 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:26,567 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:26,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-25 00:35:26,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,584 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10-25 00:35:26,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-25 00:35:26,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:26,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:26,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-25 00:35:26,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,610 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10-25 00:35:26,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-25 00:35:26,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:35:26,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:26,683 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:35:26,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-25 00:35:26,689 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:26,689 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:26,689 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:26,689 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:26,689 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:35:26,690 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,690 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:26,690 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:26,690 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration1_Loop [2024-10-25 00:35:26,690 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:26,690 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:26,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,774 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:26,781 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:35:26,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,784 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-25 00:35:26,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-25 00:35:26,788 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 [2024-10-25 00:35:26,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:26,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:26,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:26,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:26,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:26,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:26,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:26,808 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:26,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:26,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,823 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10-25 00:35:26,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-25 00:35:26,825 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 [2024-10-25 00:35:26,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:26,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:26,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:26,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:26,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:26,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:26,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:26,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:26,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:26,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,855 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10-25 00:35:26,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-25 00:35:26,857 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 [2024-10-25 00:35:26,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:26,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:26,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:26,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:26,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:26,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:26,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:26,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:26,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-25 00:35:26,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,887 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-25 00:35:26,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-25 00:35:26,888 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 [2024-10-25 00:35:26,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:26,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:26,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:26,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:26,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:26,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:26,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:26,904 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:35:26,910 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:35:26,911 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-25 00:35:26,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,933 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10-25 00:35:26,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-25 00:35:26,935 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:35:26,935 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:35:26,935 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:35:26,936 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2024-10-25 00:35:26,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:26,950 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:35:26,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:35:27,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:35:27,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:27,123 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 [2024-10-25 00:35:27,126 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:35:27,233 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 53 transitions. Complement of second has 16 states. [2024-10-25 00:35:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:35:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2024-10-25 00:35:27,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-25 00:35:27,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:27,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 7 letters. Loop has 4 letters. [2024-10-25 00:35:27,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:27,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 8 letters. [2024-10-25 00:35:27,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:27,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2024-10-25 00:35:27,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-25 00:35:27,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 23 states and 31 transitions. [2024-10-25 00:35:27,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-25 00:35:27,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-25 00:35:27,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2024-10-25 00:35:27,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:27,264 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-10-25 00:35:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2024-10-25 00:35:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-10-25 00:35:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-25 00:35:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-10-25 00:35:27,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-25 00:35:27,289 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-25 00:35:27,289 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:35:27,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-10-25 00:35:27,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-25 00:35:27,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:27,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:27,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:35:27,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:35:27,292 INFO L745 eck$LassoCheckResult]: Stem: 130#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 120#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 132#$Ultimate##0 ~n := #in~n; 126#L17 assume !(~n < 1); 127#L19 assume !(1 == ~n); 119#L22 call #t~ret4 := fibonacci(~n - 1);< 128#$Ultimate##0 ~n := #in~n; 123#L17 assume ~n < 1;#res := 0; 124#fibonacciFINAL assume true; 129#fibonacciEXIT >#31#return; 118#L22-1 [2024-10-25 00:35:27,292 INFO L747 eck$LassoCheckResult]: Loop: 118#L22-1 call #t~ret5 := fibonacci(~n - 2);< 122#$Ultimate##0 ~n := #in~n; 137#L17 assume !(~n < 1); 136#L19 assume !(1 == ~n); 121#L22 call #t~ret4 := fibonacci(~n - 1);< 122#$Ultimate##0 ~n := #in~n; 137#L17 assume ~n < 1;#res := 0; 134#fibonacciFINAL assume true; 135#fibonacciEXIT >#31#return; 118#L22-1 [2024-10-25 00:35:27,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2073663503, now seen corresponding path program 1 times [2024-10-25 00:35:27,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:27,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810832241] [2024-10-25 00:35:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-25 00:35:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 00:35:27,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:35:27,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810832241] [2024-10-25 00:35:27,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810832241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:35:27,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:35:27,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:35:27,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472953389] [2024-10-25 00:35:27,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:35:27,437 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:35:27,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:27,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1606275375, now seen corresponding path program 1 times [2024-10-25 00:35:27,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:27,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199717760] [2024-10-25 00:35:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:27,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-25 00:35:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 00:35:27,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:35:27,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199717760] [2024-10-25 00:35:27,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199717760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:35:27,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:35:27,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:35:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156043069] [2024-10-25 00:35:27,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:35:27,540 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:35:27,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:35:27,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-25 00:35:27,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-25 00:35:27,545 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-25 00:35:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:35:27,631 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2024-10-25 00:35:27,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2024-10-25 00:35:27,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-25 00:35:27,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2024-10-25 00:35:27,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-25 00:35:27,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-25 00:35:27,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2024-10-25 00:35:27,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:27,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-25 00:35:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2024-10-25 00:35:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-25 00:35:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-25 00:35:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-25 00:35:27,641 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-25 00:35:27,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:35:27,642 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-25 00:35:27,643 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:35:27,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2024-10-25 00:35:27,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-25 00:35:27,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:27,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:27,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:35:27,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-25 00:35:27,647 INFO L745 eck$LassoCheckResult]: Stem: 202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 203#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 191#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 201#$Ultimate##0 ~n := #in~n; 196#L17 assume !(~n < 1); 197#L19 assume !(1 == ~n); 192#L22 call #t~ret4 := fibonacci(~n - 1);< 198#$Ultimate##0 ~n := #in~n; 194#L17 assume !(~n < 1); 195#L19 assume 1 == ~n;#res := 1; 205#fibonacciFINAL assume true; 208#fibonacciEXIT >#31#return; 189#L22-1 [2024-10-25 00:35:27,647 INFO L747 eck$LassoCheckResult]: Loop: 189#L22-1 call #t~ret5 := fibonacci(~n - 2);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume !(~n < 1); 209#L19 assume !(1 == ~n); 190#L22 call #t~ret4 := fibonacci(~n - 1);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume !(~n < 1); 209#L19 assume !(1 == ~n); 190#L22 call #t~ret4 := fibonacci(~n - 1);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume !(~n < 1); 209#L19 assume 1 == ~n;#res := 1; 210#fibonacciFINAL assume true; 207#fibonacciEXIT >#31#return; 189#L22-1 call #t~ret5 := fibonacci(~n - 2);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume ~n < 1;#res := 0; 212#fibonacciFINAL assume true; 199#fibonacciEXIT >#33#return; 200#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 204#fibonacciFINAL assume true; 206#fibonacciEXIT >#31#return; 189#L22-1 [2024-10-25 00:35:27,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash -140916419, now seen corresponding path program 1 times [2024-10-25 00:35:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:27,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60502426] [2024-10-25 00:35:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:27,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:27,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:27,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1749360471, now seen corresponding path program 1 times [2024-10-25 00:35:27,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:27,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664795440] [2024-10-25 00:35:27,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:27,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:27,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:27,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash 998757605, now seen corresponding path program 1 times [2024-10-25 00:35:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:27,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957638102] [2024-10-25 00:35:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:27,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-25 00:35:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-25 00:35:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-25 00:35:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 00:35:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:35:27,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957638102] [2024-10-25 00:35:27,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957638102] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:35:27,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947752883] [2024-10-25 00:35:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:27,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:35:27,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:27,914 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:35:27,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-25 00:35:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:27,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:35:27,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-25 00:35:28,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:35:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 00:35:28,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947752883] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:35:28,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:35:28,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-10-25 00:35:28,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968728459] [2024-10-25 00:35:28,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:35:28,375 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:28,375 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:28,375 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:28,375 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:28,375 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:35:28,376 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:28,376 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:28,376 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:28,376 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration3_Loop [2024-10-25 00:35:28,376 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:28,376 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:28,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:28,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:28,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:28,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:28,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:28,439 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:28,439 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:35:28,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:28,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:28,443 INFO L229 MonitoredProcess]: Starting monitored process 13 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-10-25 00:35:28,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-25 00:35:28,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:28,445 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:28,461 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:28,461 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#in~n=3} Honda state: {fibonacci_#in~n=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:28,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-25 00:35:28,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:28,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:28,475 INFO L229 MonitoredProcess]: Starting monitored process 14 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-10-25 00:35:28,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-25 00:35:28,477 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:28,477 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:28,489 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:28,489 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret5=0} Honda state: {fibonacci_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:28,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-25 00:35:28,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:28,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:28,503 INFO L229 MonitoredProcess]: Starting monitored process 15 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-10-25 00:35:28,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-25 00:35:28,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:28,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:28,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:28,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:28,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:28,531 INFO L229 MonitoredProcess]: Starting monitored process 16 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-10-25 00:35:28,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-25 00:35:28,533 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:35:28,533 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:28,546 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:35:28,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:28,563 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:28,563 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:28,563 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:28,563 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:28,563 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:35:28,563 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:28,563 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:28,563 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:28,563 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration3_Loop [2024-10-25 00:35:28,563 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:28,563 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:28,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:28,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:28,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:28,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:28,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:28,634 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:28,634 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:35:28,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:28,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:28,636 INFO L229 MonitoredProcess]: Starting monitored process 17 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-10-25 00:35:28,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-25 00:35:28,639 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 [2024-10-25 00:35:28,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:28,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:28,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:28,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:28,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:28,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:28,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:28,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:28,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:28,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:28,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:28,665 INFO L229 MonitoredProcess]: Starting monitored process 18 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-10-25 00:35:28,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-25 00:35:28,667 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 [2024-10-25 00:35:28,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:28,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:28,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:28,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:28,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:28,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:28,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:28,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:28,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-25 00:35:28,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:28,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:28,699 INFO L229 MonitoredProcess]: Starting monitored process 19 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-10-25 00:35:28,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-25 00:35:28,701 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 [2024-10-25 00:35:28,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:28,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:28,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:28,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:28,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:28,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:28,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:28,714 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:35:28,717 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:35:28,717 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-25 00:35:28,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:28,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:28,719 INFO L229 MonitoredProcess]: Starting monitored process 20 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-10-25 00:35:28,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-25 00:35:28,721 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:35:28,721 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:35:28,722 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:35:28,722 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2024-10-25 00:35:28,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:28,733 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:35:28,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:28,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:35:28,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:28,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-25 00:35:28,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:28,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-25 00:35:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 00:35:29,140 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-25 00:35:29,140 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-25 00:35:29,390 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Result 152 states and 210 transitions. Complement of second has 54 states. [2024-10-25 00:35:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-25 00:35:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2024-10-25 00:35:29,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 40 transitions. Stem has 12 letters. Loop has 22 letters. [2024-10-25 00:35:29,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:29,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 40 transitions. Stem has 34 letters. Loop has 22 letters. [2024-10-25 00:35:29,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:29,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 40 transitions. Stem has 12 letters. Loop has 44 letters. [2024-10-25 00:35:29,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:29,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 210 transitions. [2024-10-25 00:35:29,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-10-25 00:35:29,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 125 states and 179 transitions. [2024-10-25 00:35:29,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-10-25 00:35:29,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-10-25 00:35:29,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 179 transitions. [2024-10-25 00:35:29,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:29,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 179 transitions. [2024-10-25 00:35:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 179 transitions. [2024-10-25 00:35:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2024-10-25 00:35:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 70 states have internal predecessors, (81), 25 states have call successors, (26), 13 states have call predecessors, (26), 15 states have return successors, (35), 22 states have call predecessors, (35), 23 states have call successors, (35) [2024-10-25 00:35:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 142 transitions. [2024-10-25 00:35:29,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 142 transitions. [2024-10-25 00:35:29,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:35:29,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-25 00:35:29,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-25 00:35:29,431 INFO L87 Difference]: Start difference. First operand 106 states and 142 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-25 00:35:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:35:29,491 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2024-10-25 00:35:29,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2024-10-25 00:35:29,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-25 00:35:29,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 53 transitions. [2024-10-25 00:35:29,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-25 00:35:29,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-25 00:35:29,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2024-10-25 00:35:29,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:29,494 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-10-25 00:35:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2024-10-25 00:35:29,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-10-25 00:35:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-25 00:35:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-10-25 00:35:29,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-25 00:35:29,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 00:35:29,500 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-25 00:35:29,500 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:35:29,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-10-25 00:35:29,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-25 00:35:29,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:29,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:29,502 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:35:29,502 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-25 00:35:29,505 INFO L745 eck$LassoCheckResult]: Stem: 959#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 960#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 952#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 961#$Ultimate##0 ~n := #in~n; 951#L17 assume !(~n < 1); 953#L19 assume !(1 == ~n); 955#L22 call #t~ret4 := fibonacci(~n - 1);< 956#$Ultimate##0 ~n := #in~n; 967#L17 assume !(~n < 1); 981#L19 assume !(1 == ~n); 962#L22 call #t~ret4 := fibonacci(~n - 1);< 956#$Ultimate##0 ~n := #in~n; 966#L17 assume !(~n < 1); 964#L19 assume 1 == ~n;#res := 1; 965#fibonacciFINAL assume true; 979#fibonacciEXIT >#31#return; 976#L22-1 call #t~ret5 := fibonacci(~n - 2);< 977#$Ultimate##0 ~n := #in~n; 980#L17 assume ~n < 1;#res := 0; 978#fibonacciFINAL assume true; 975#fibonacciEXIT >#33#return; 974#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 973#fibonacciFINAL assume true; 972#fibonacciEXIT >#31#return; 947#L22-1 [2024-10-25 00:35:29,505 INFO L747 eck$LassoCheckResult]: Loop: 947#L22-1 call #t~ret5 := fibonacci(~n - 2);< 954#$Ultimate##0 ~n := #in~n; 970#L17 assume !(~n < 1); 968#L19 assume !(1 == ~n); 946#L22 call #t~ret4 := fibonacci(~n - 1);< 954#$Ultimate##0 ~n := #in~n; 970#L17 assume !(~n < 1); 968#L19 assume !(1 == ~n); 946#L22 call #t~ret4 := fibonacci(~n - 1);< 954#$Ultimate##0 ~n := #in~n; 970#L17 assume !(~n < 1); 968#L19 assume 1 == ~n;#res := 1; 969#fibonacciFINAL assume true; 982#fibonacciEXIT >#31#return; 945#L22-1 call #t~ret5 := fibonacci(~n - 2);< 948#$Ultimate##0 ~n := #in~n; 949#L17 assume ~n < 1;#res := 0; 950#fibonacciFINAL assume true; 957#fibonacciEXIT >#33#return; 958#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 963#fibonacciFINAL assume true; 971#fibonacciEXIT >#31#return; 947#L22-1 [2024-10-25 00:35:29,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash 62997961, now seen corresponding path program 2 times [2024-10-25 00:35:29,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:29,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748114916] [2024-10-25 00:35:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:29,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:29,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:29,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1749360471, now seen corresponding path program 2 times [2024-10-25 00:35:29,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:29,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391259150] [2024-10-25 00:35:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:29,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:29,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:29,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:29,553 INFO L85 PathProgramCache]: Analyzing trace with hash 969547889, now seen corresponding path program 3 times [2024-10-25 00:35:29,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:29,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441440730] [2024-10-25 00:35:29,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:29,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:29,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-25 00:35:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:29,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:29,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-25 00:35:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:29,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:35:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:29,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:29,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-25 00:35:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 16 proven. 46 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-25 00:35:29,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:35:29,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441440730] [2024-10-25 00:35:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441440730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:35:29,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389573790] [2024-10-25 00:35:29,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 00:35:29,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:35:29,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:29,730 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:35:29,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-25 00:35:29,778 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-25 00:35:29,778 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:35:29,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-25 00:35:29,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 47 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-25 00:35:29,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:35:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-25 00:35:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389573790] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:35:30,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:35:30,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 21 [2024-10-25 00:35:30,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255355059] [2024-10-25 00:35:30,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:35:30,413 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:30,413 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:30,413 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:30,414 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:30,414 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:35:30,414 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:30,414 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:30,414 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:30,414 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration4_Loop [2024-10-25 00:35:30,414 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:30,414 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:30,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:30,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:30,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:30,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:30,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:30,465 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:30,465 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:35:30,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:30,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:30,468 INFO L229 MonitoredProcess]: Starting monitored process 22 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-10-25 00:35:30,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-25 00:35:30,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:30,471 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:30,489 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:30,489 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#in~n=3} Honda state: {fibonacci_#in~n=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:30,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-25 00:35:30,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:30,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:30,507 INFO L229 MonitoredProcess]: Starting monitored process 23 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-10-25 00:35:30,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-25 00:35:30,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:30,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:30,520 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:30,521 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:30,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:30,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:30,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:30,533 INFO L229 MonitoredProcess]: Starting monitored process 24 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-10-25 00:35:30,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-25 00:35:30,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:30,535 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:30,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:30,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:30,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:30,559 INFO L229 MonitoredProcess]: Starting monitored process 25 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-10-25 00:35:30,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-25 00:35:30,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:35:30,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:30,574 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:35:30,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:30,585 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:30,585 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:30,585 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:30,585 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:30,585 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:35:30,585 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:30,585 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:30,585 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:30,585 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration4_Loop [2024-10-25 00:35:30,585 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:30,585 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:30,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:30,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:30,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:30,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:30,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:30,639 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:30,639 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:35:30,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:30,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:30,642 INFO L229 MonitoredProcess]: Starting monitored process 26 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-10-25 00:35:30,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-25 00:35:30,646 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 [2024-10-25 00:35:30,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:30,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:30,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:30,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:30,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:30,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:30,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:30,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:30,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:30,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:30,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:30,676 INFO L229 MonitoredProcess]: Starting monitored process 27 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-10-25 00:35:30,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-25 00:35:30,678 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 [2024-10-25 00:35:30,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:30,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:30,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:30,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:30,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:30,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:30,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:30,696 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:35:30,698 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-25 00:35:30,698 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:35:30,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:30,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:30,700 INFO L229 MonitoredProcess]: Starting monitored process 28 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-10-25 00:35:30,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-25 00:35:30,703 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:35:30,703 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:35:30,703 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:35:30,703 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2024-10-25 00:35:30,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:30,715 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:35:30,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:30,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-25 00:35:30,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:30,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-25 00:35:30,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 00:35:31,108 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-25 00:35:31,108 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-25 00:35:31,207 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 45 states and 54 transitions. Complement of second has 11 states. [2024-10-25 00:35:31,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-25 00:35:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2024-10-25 00:35:31,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 24 letters. Loop has 22 letters. [2024-10-25 00:35:31,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:31,210 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:35:31,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:31,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-25 00:35:31,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:31,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-25 00:35:31,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:31,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 00:35:31,588 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-25 00:35:31,589 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-25 00:35:31,685 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 45 states and 54 transitions. Complement of second has 11 states. [2024-10-25 00:35:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-25 00:35:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2024-10-25 00:35:31,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 24 letters. Loop has 22 letters. [2024-10-25 00:35:31,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:31,686 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:35:31,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:31,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-25 00:35:31,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:31,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-25 00:35:31,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 00:35:32,019 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-25 00:35:32,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-25 00:35:32,291 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 331 states and 432 transitions. Complement of second has 134 states. [2024-10-25 00:35:32,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-25 00:35:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2024-10-25 00:35:32,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 24 letters. Loop has 22 letters. [2024-10-25 00:35:32,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:32,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 46 letters. Loop has 22 letters. [2024-10-25 00:35:32,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:32,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 24 letters. Loop has 44 letters. [2024-10-25 00:35:32,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:32,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 432 transitions. [2024-10-25 00:35:32,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-25 00:35:32,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 215 states and 294 transitions. [2024-10-25 00:35:32,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2024-10-25 00:35:32,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2024-10-25 00:35:32,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 294 transitions. [2024-10-25 00:35:32,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:32,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 215 states and 294 transitions. [2024-10-25 00:35:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 294 transitions. [2024-10-25 00:35:32,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 173. [2024-10-25 00:35:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 113 states have internal predecessors, (122), 38 states have call successors, (42), 23 states have call predecessors, (42), 28 states have return successors, (61), 36 states have call predecessors, (61), 36 states have call successors, (61) [2024-10-25 00:35:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 225 transitions. [2024-10-25 00:35:32,349 INFO L240 hiAutomatonCegarLoop]: Abstraction has 173 states and 225 transitions. [2024-10-25 00:35:32,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:35:32,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-25 00:35:32,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-10-25 00:35:32,350 INFO L87 Difference]: Start difference. First operand 173 states and 225 transitions. Second operand has 21 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 13 states have call successors, (17), 3 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2024-10-25 00:35:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:35:32,613 INFO L93 Difference]: Finished difference Result 344 states and 500 transitions. [2024-10-25 00:35:32,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 500 transitions. [2024-10-25 00:35:32,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-25 00:35:32,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 334 states and 487 transitions. [2024-10-25 00:35:32,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 170 [2024-10-25 00:35:32,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2024-10-25 00:35:32,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 334 states and 487 transitions. [2024-10-25 00:35:32,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:32,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 334 states and 487 transitions. [2024-10-25 00:35:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states and 487 transitions. [2024-10-25 00:35:32,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 265. [2024-10-25 00:35:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 164 states have (on average 1.1341463414634145) internal successors, (186), 166 states have internal predecessors, (186), 60 states have call successors, (72), 35 states have call predecessors, (72), 41 states have return successors, (136), 63 states have call predecessors, (136), 58 states have call successors, (136) [2024-10-25 00:35:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 394 transitions. [2024-10-25 00:35:32,668 INFO L240 hiAutomatonCegarLoop]: Abstraction has 265 states and 394 transitions. [2024-10-25 00:35:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-25 00:35:32,673 INFO L425 stractBuchiCegarLoop]: Abstraction has 265 states and 394 transitions. [2024-10-25 00:35:32,673 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:35:32,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 394 transitions. [2024-10-25 00:35:32,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-25 00:35:32,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:32,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:32,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 9, 7, 7, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2024-10-25 00:35:32,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:35:32,677 INFO L745 eck$LassoCheckResult]: Stem: 2933#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 2934#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 2935#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 2936#$Ultimate##0 ~n := #in~n; 2982#L17 assume !(~n < 1); 2980#L19 assume !(1 == ~n); 2972#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2981#L17 assume !(~n < 1); 2979#L19 assume !(1 == ~n); 2973#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2981#L17 assume !(~n < 1); 2979#L19 assume !(1 == ~n); 2973#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2981#L17 assume !(~n < 1); 2979#L19 assume !(1 == ~n); 2973#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2983#L17 assume !(~n < 1); 3109#L19 assume 1 == ~n;#res := 1; 3107#fibonacciFINAL assume true; 3104#fibonacciEXIT >#31#return; 3101#L22-1 call #t~ret5 := fibonacci(~n - 2);< 3102#$Ultimate##0 ~n := #in~n; 3108#L17 assume ~n < 1;#res := 0; 3106#fibonacciFINAL assume true; 3100#fibonacciEXIT >#33#return; 3098#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 3097#fibonacciFINAL assume true; 3094#fibonacciEXIT >#31#return; 3006#L22-1 call #t~ret5 := fibonacci(~n - 2);< 3007#$Ultimate##0 ~n := #in~n; 3053#L17 assume !(~n < 1); 3021#L19 assume 1 == ~n;#res := 1; 2960#fibonacciFINAL assume true; 3004#fibonacciEXIT >#33#return; 3002#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 2997#fibonacciFINAL assume true; 2988#fibonacciEXIT >#31#return; 2987#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2990#$Ultimate##0 ~n := #in~n; 3064#L17 assume !(~n < 1); 3019#L19 assume !(1 == ~n); 3020#L22 call #t~ret4 := fibonacci(~n - 1);< 3167#$Ultimate##0 ~n := #in~n; 3113#L17 assume !(~n < 1); 3115#L19 assume 1 == ~n;#res := 1; 3168#fibonacciFINAL assume true; 3165#fibonacciEXIT >#31#return; 2950#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2949#$Ultimate##0 ~n := #in~n; 2952#L17 assume ~n < 1;#res := 0; 3009#fibonacciFINAL assume true; 3000#fibonacciEXIT >#33#return; 3001#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 2996#fibonacciFINAL assume true; 2986#fibonacciEXIT >#33#return; 2974#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 2977#fibonacciFINAL assume true; 2971#fibonacciEXIT >#31#return; 2965#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2966#$Ultimate##0 ~n := #in~n; 3172#L17 assume !(~n < 1); 3171#L19 assume !(1 == ~n); 3127#L22 call #t~ret4 := fibonacci(~n - 1);< 3166#$Ultimate##0 ~n := #in~n; 3142#L17 assume !(~n < 1); 3143#L19 assume !(1 == ~n); 3122#L22 call #t~ret4 := fibonacci(~n - 1);< 3128#$Ultimate##0 [2024-10-25 00:35:32,677 INFO L747 eck$LassoCheckResult]: Loop: 3128#$Ultimate##0 ~n := #in~n; 3140#L17 assume !(~n < 1); 3138#L19 assume !(1 == ~n); 3124#L22 call #t~ret4 := fibonacci(~n - 1);< 3128#$Ultimate##0 [2024-10-25 00:35:32,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:32,678 INFO L85 PathProgramCache]: Analyzing trace with hash -627327765, now seen corresponding path program 4 times [2024-10-25 00:35:32,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:32,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380081740] [2024-10-25 00:35:32,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:32,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:32,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:32,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:32,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash 927643, now seen corresponding path program 2 times [2024-10-25 00:35:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:32,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040072755] [2024-10-25 00:35:32,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:32,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:32,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:32,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:32,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:32,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2068668293, now seen corresponding path program 5 times [2024-10-25 00:35:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:32,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072565468] [2024-10-25 00:35:32,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:32,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:32,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-25 00:35:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:33,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:33,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:33,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-25 00:35:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:33,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-25 00:35:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:33,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-25 00:35:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:33,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:33,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-25 00:35:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 110 proven. 115 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-25 00:35:33,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:35:33,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072565468] [2024-10-25 00:35:33,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072565468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:35:33,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178374049] [2024-10-25 00:35:33,105 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-25 00:35:33,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:35:33,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:33,107 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:35:33,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-25 00:35:33,166 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-10-25 00:35:33,166 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:35:33,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-25 00:35:33,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 110 proven. 115 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-25 00:35:33,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:35:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 110 proven. 130 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-25 00:35:33,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178374049] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:35:33,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:35:33,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 20 [2024-10-25 00:35:33,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737968352] [2024-10-25 00:35:33,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:35:33,805 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:33,805 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:33,805 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:33,805 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:33,805 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:35:33,805 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:33,805 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:33,805 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:33,805 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration5_Loop [2024-10-25 00:35:33,805 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:33,805 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:33,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:33,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:33,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:33,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:33,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:33,845 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:33,845 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:35:33,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:33,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:33,848 INFO L229 MonitoredProcess]: Starting monitored process 30 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-10-25 00:35:33,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-25 00:35:33,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:33,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:33,866 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:33,866 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret4=0} Honda state: {fibonacci_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:33,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-25 00:35:33,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:33,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:33,884 INFO L229 MonitoredProcess]: Starting monitored process 31 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-10-25 00:35:33,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-25 00:35:33,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:33,886 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:33,900 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:33,900 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:33,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:33,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:33,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:33,916 INFO L229 MonitoredProcess]: Starting monitored process 32 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-10-25 00:35:33,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-25 00:35:33,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:33,920 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:33,931 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:33,932 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:33,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:33,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:33,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:33,943 INFO L229 MonitoredProcess]: Starting monitored process 33 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-10-25 00:35:33,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-25 00:35:33,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:33,945 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:33,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:33,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:33,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:33,968 INFO L229 MonitoredProcess]: Starting monitored process 34 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-10-25 00:35:33,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-25 00:35:33,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:35:33,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:33,996 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:35:34,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:34,001 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:34,001 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:34,001 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:34,001 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:34,001 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:35:34,001 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:34,001 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:34,001 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:34,001 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration5_Loop [2024-10-25 00:35:34,001 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:34,001 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:34,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:34,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:34,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:34,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:34,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:34,049 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:34,049 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:35:34,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:34,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:34,055 INFO L229 MonitoredProcess]: Starting monitored process 35 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-10-25 00:35:34,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-25 00:35:34,058 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 [2024-10-25 00:35:34,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:34,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:34,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:34,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:34,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:34,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:34,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:34,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:34,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:34,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:34,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:34,092 INFO L229 MonitoredProcess]: Starting monitored process 36 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-10-25 00:35:34,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-25 00:35:34,094 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 [2024-10-25 00:35:34,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:34,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:34,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:34,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:34,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:34,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:34,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:34,108 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:34,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:34,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:34,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:34,124 INFO L229 MonitoredProcess]: Starting monitored process 37 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-10-25 00:35:34,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-25 00:35:34,128 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 [2024-10-25 00:35:34,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:34,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:34,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:34,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:34,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:34,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:34,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:34,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:34,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:34,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:34,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:34,161 INFO L229 MonitoredProcess]: Starting monitored process 38 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-10-25 00:35:34,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-25 00:35:34,163 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 [2024-10-25 00:35:34,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:34,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:34,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:34,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:34,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:34,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:34,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:34,176 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:35:34,178 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-25 00:35:34,178 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:35:34,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:34,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:34,181 INFO L229 MonitoredProcess]: Starting monitored process 39 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-10-25 00:35:34,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-25 00:35:34,183 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:35:34,183 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:35:34,183 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:35:34,183 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2024-10-25 00:35:34,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-25 00:35:34,197 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:35:34,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:34,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-25 00:35:34,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:34,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:34,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:35:34,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:34,794 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-25 00:35:34,794 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:34,848 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 287 states and 420 transitions. Complement of second has 17 states. [2024-10-25 00:35:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-10-25 00:35:34,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 71 letters. Loop has 4 letters. [2024-10-25 00:35:34,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:34,850 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:35:34,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:34,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-25 00:35:34,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:35,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:35:35,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:35,464 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-25 00:35:35,465 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:35,527 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 287 states and 420 transitions. Complement of second has 17 states. [2024-10-25 00:35:35,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-10-25 00:35:35,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 71 letters. Loop has 4 letters. [2024-10-25 00:35:35,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:35,529 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:35:35,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:35,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-25 00:35:35,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:36,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:35:36,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:36,102 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-25 00:35:36,103 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:36,183 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 340 states and 477 transitions. Complement of second has 19 states. [2024-10-25 00:35:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2024-10-25 00:35:36,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 71 letters. Loop has 4 letters. [2024-10-25 00:35:36,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:36,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 75 letters. Loop has 4 letters. [2024-10-25 00:35:36,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:36,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 71 letters. Loop has 8 letters. [2024-10-25 00:35:36,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:36,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 477 transitions. [2024-10-25 00:35:36,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-25 00:35:36,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 279 states and 410 transitions. [2024-10-25 00:35:36,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2024-10-25 00:35:36,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2024-10-25 00:35:36,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 410 transitions. [2024-10-25 00:35:36,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:36,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 279 states and 410 transitions. [2024-10-25 00:35:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 410 transitions. [2024-10-25 00:35:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2024-10-25 00:35:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 169 states have (on average 1.1301775147928994) internal successors, (191), 171 states have internal predecessors, (191), 61 states have call successors, (73), 36 states have call predecessors, (73), 41 states have return successors, (138), 63 states have call predecessors, (138), 59 states have call successors, (138) [2024-10-25 00:35:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 402 transitions. [2024-10-25 00:35:36,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 271 states and 402 transitions. [2024-10-25 00:35:36,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:35:36,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-25 00:35:36,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2024-10-25 00:35:36,212 INFO L87 Difference]: Start difference. First operand 271 states and 402 transitions. Second operand has 20 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 16 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2024-10-25 00:35:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:35:36,404 INFO L93 Difference]: Finished difference Result 483 states and 750 transitions. [2024-10-25 00:35:36,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 750 transitions. [2024-10-25 00:35:36,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-25 00:35:36,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 478 states and 743 transitions. [2024-10-25 00:35:36,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 247 [2024-10-25 00:35:36,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2024-10-25 00:35:36,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 478 states and 743 transitions. [2024-10-25 00:35:36,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:36,442 INFO L218 hiAutomatonCegarLoop]: Abstraction has 478 states and 743 transitions. [2024-10-25 00:35:36,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states and 743 transitions. [2024-10-25 00:35:36,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 362. [2024-10-25 00:35:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 225 states have (on average 1.1511111111111112) internal successors, (259), 225 states have internal predecessors, (259), 83 states have call successors, (99), 48 states have call predecessors, (99), 54 states have return successors, (218), 88 states have call predecessors, (218), 81 states have call successors, (218) [2024-10-25 00:35:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 576 transitions. [2024-10-25 00:35:36,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-10-25 00:35:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 00:35:36,473 INFO L425 stractBuchiCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-10-25 00:35:36,474 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:35:36,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 362 states and 576 transitions. [2024-10-25 00:35:36,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-25 00:35:36,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:36,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:36,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 17, 15, 12, 11, 8, 8, 7, 7, 5, 3, 1, 1, 1] [2024-10-25 00:35:36,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:35:36,482 INFO L745 eck$LassoCheckResult]: Stem: 6253#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 6254#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 6255#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 6256#$Ultimate##0 ~n := #in~n; 6321#L17 assume !(~n < 1); 6319#L19 assume !(1 == ~n); 6294#L22 call #t~ret4 := fibonacci(~n - 1);< 6317#$Ultimate##0 ~n := #in~n; 6315#L17 assume !(~n < 1); 6313#L19 assume !(1 == ~n); 6221#L22 call #t~ret4 := fibonacci(~n - 1);< 6298#$Ultimate##0 ~n := #in~n; 6316#L17 assume !(~n < 1); 6314#L19 assume !(1 == ~n); 6222#L22 call #t~ret4 := fibonacci(~n - 1);< 6298#$Ultimate##0 ~n := #in~n; 6316#L17 assume !(~n < 1); 6314#L19 assume !(1 == ~n); 6222#L22 call #t~ret4 := fibonacci(~n - 1);< 6298#$Ultimate##0 ~n := #in~n; 6316#L17 assume !(~n < 1); 6314#L19 assume !(1 == ~n); 6222#L22 call #t~ret4 := fibonacci(~n - 1);< 6298#$Ultimate##0 ~n := #in~n; 6316#L17 assume !(~n < 1); 6314#L19 assume !(1 == ~n); 6222#L22 call #t~ret4 := fibonacci(~n - 1);< 6298#$Ultimate##0 ~n := #in~n; 6318#L17 assume !(~n < 1); 6263#L19 assume 1 == ~n;#res := 1; 6264#fibonacciFINAL assume true; 6563#fibonacciEXIT >#31#return; 6220#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6223#$Ultimate##0 ~n := #in~n; 6574#L17 assume ~n < 1;#res := 0; 6573#fibonacciFINAL assume true; 6571#fibonacciEXIT >#33#return; 6570#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6569#fibonacciFINAL assume true; 6564#fibonacciEXIT >#31#return; 6230#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6365#$Ultimate##0 ~n := #in~n; 6382#L17 assume !(~n < 1); 6371#L19 assume 1 == ~n;#res := 1; 6277#fibonacciFINAL assume true; 6363#fibonacciEXIT >#33#return; 6360#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6355#fibonacciFINAL assume true; 6312#fibonacciEXIT >#31#return; 6233#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6308#$Ultimate##0 ~n := #in~n; 6477#L17 assume !(~n < 1); 6370#L19 assume !(1 == ~n); 6333#L22 call #t~ret4 := fibonacci(~n - 1);< 6334#$Ultimate##0 ~n := #in~n; 6483#L17 assume !(~n < 1); 6354#L19 assume 1 == ~n;#res := 1; 6353#fibonacciFINAL assume true; 6331#fibonacciEXIT >#31#return; 6325#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6330#$Ultimate##0 ~n := #in~n; 6378#L17 assume ~n < 1;#res := 0; 6377#fibonacciFINAL assume true; 6322#fibonacciEXIT >#33#return; 6320#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6310#fibonacciFINAL assume true; 6306#fibonacciEXIT >#33#return; 6302#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6300#fibonacciFINAL assume true; 6296#fibonacciEXIT >#31#return; 6232#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6295#$Ultimate##0 ~n := #in~n; 6292#L17 assume !(~n < 1); 6276#L19 assume !(1 == ~n); 6278#L22 call #t~ret4 := fibonacci(~n - 1);< 6458#$Ultimate##0 ~n := #in~n; 6459#L17 assume !(~n < 1); 6455#L19 assume !(1 == ~n); 6410#L22 call #t~ret4 := fibonacci(~n - 1);< 6415#$Ultimate##0 ~n := #in~n; 6398#L17 assume !(~n < 1); 6416#L19 assume 1 == ~n;#res := 1; 6413#fibonacciFINAL assume true; 6409#fibonacciEXIT >#31#return; 6401#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6407#$Ultimate##0 ~n := #in~n; 6412#L17 assume ~n < 1;#res := 0; 6408#fibonacciFINAL assume true; 6399#fibonacciEXIT >#33#return; 6405#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6567#fibonacciFINAL assume true; 6565#fibonacciEXIT >#31#return; 6364#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6365#$Ultimate##0 ~n := #in~n; 6382#L17 assume !(~n < 1); 6371#L19 assume 1 == ~n;#res := 1; 6277#fibonacciFINAL assume true; 6363#fibonacciEXIT >#33#return; 6360#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6355#fibonacciFINAL assume true; 6312#fibonacciEXIT >#33#return; 6297#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6434#fibonacciFINAL assume true; 6303#fibonacciEXIT >#31#return; 6234#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6286#$Ultimate##0 ~n := #in~n; 6293#L17 assume !(~n < 1); 6291#L19 assume !(1 == ~n); 6246#L22 call #t~ret4 := fibonacci(~n - 1);< 6482#$Ultimate##0 ~n := #in~n; 6484#L17 assume !(~n < 1); 6578#L19 assume !(1 == ~n); 6244#L22 call #t~ret4 := fibonacci(~n - 1);< 6247#$Ultimate##0 ~n := #in~n; 6486#L17 assume !(~n < 1); 6509#L19 assume !(1 == ~n); 6485#L22 [2024-10-25 00:35:36,482 INFO L747 eck$LassoCheckResult]: Loop: 6485#L22 call #t~ret4 := fibonacci(~n - 1);< 6247#$Ultimate##0 ~n := #in~n; 6486#L17 assume !(~n < 1); 6509#L19 assume !(1 == ~n); 6485#L22 [2024-10-25 00:35:36,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash 664454499, now seen corresponding path program 6 times [2024-10-25 00:35:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:36,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296263735] [2024-10-25 00:35:36,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:36,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:36,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:36,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:36,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1817383, now seen corresponding path program 3 times [2024-10-25 00:35:36,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:36,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165708679] [2024-10-25 00:35:36,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:36,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:36,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:36,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:36,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1473183863, now seen corresponding path program 7 times [2024-10-25 00:35:36,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:36,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605212026] [2024-10-25 00:35:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:36,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:36,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-25 00:35:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:36,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-25 00:35:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-25 00:35:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-25 00:35:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-25 00:35:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-25 00:35:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-25 00:35:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-25 00:35:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-25 00:35:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 260 proven. 268 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-25 00:35:37,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:35:37,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605212026] [2024-10-25 00:35:37,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605212026] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:35:37,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175272451] [2024-10-25 00:35:37,080 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-25 00:35:37,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:35:37,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:37,082 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:35:37,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-10-25 00:35:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:37,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-25 00:35:37,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 260 proven. 268 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-25 00:35:37,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:35:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 260 proven. 294 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-10-25 00:35:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175272451] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:35:38,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:35:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 17] total 23 [2024-10-25 00:35:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832629820] [2024-10-25 00:35:38,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:35:38,099 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:38,100 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:38,100 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:38,100 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:38,100 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:35:38,100 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:38,100 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:38,100 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:38,100 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration6_Loop [2024-10-25 00:35:38,100 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:38,100 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:38,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:38,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:38,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:38,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:38,148 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:38,149 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:35:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:38,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:38,150 INFO L229 MonitoredProcess]: Starting monitored process 41 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-10-25 00:35:38,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-25 00:35:38,152 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:38,152 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:38,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-25 00:35:38,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:38,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:38,195 INFO L229 MonitoredProcess]: Starting monitored process 42 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-10-25 00:35:38,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-25 00:35:38,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:35:38,197 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:39,424 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:35:39,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:39,429 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:39,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:39,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:39,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:39,430 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:35:39,430 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:39,430 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:39,430 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:39,430 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration6_Loop [2024-10-25 00:35:39,430 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:39,430 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:39,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:39,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:39,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:39,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:39,468 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:39,468 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:35:39,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:39,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:39,470 INFO L229 MonitoredProcess]: Starting monitored process 43 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-10-25 00:35:39,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-25 00:35:39,482 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 [2024-10-25 00:35:39,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:39,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:39,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:39,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:39,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:39,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:39,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:39,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:39,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-25 00:35:39,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:39,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:39,506 INFO L229 MonitoredProcess]: Starting monitored process 44 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-10-25 00:35:39,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-25 00:35:39,508 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 [2024-10-25 00:35:39,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:39,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:39,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:39,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:39,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:39,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:39,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:39,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:39,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:39,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:39,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:39,533 INFO L229 MonitoredProcess]: Starting monitored process 45 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-10-25 00:35:39,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-25 00:35:39,535 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 [2024-10-25 00:35:39,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:39,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:39,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:39,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:39,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:39,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:39,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:39,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:35:39,550 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:35:39,550 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-25 00:35:39,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:39,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:39,552 INFO L229 MonitoredProcess]: Starting monitored process 46 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-10-25 00:35:39,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-25 00:35:39,556 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:35:39,556 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:35:39,556 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:35:39,556 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2024-10-25 00:35:39,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-25 00:35:39,568 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:35:39,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:39,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-25 00:35:39,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:40,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:40,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:35:40,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:40,473 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-25 00:35:40,473 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:40,525 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 369 states and 584 transitions. Complement of second has 18 states. [2024-10-25 00:35:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2024-10-25 00:35:40,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 116 letters. Loop has 4 letters. [2024-10-25 00:35:40,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:40,526 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:35:40,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:40,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-25 00:35:40,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:41,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:35:41,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:41,393 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-25 00:35:41,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:41,474 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 377 states and 592 transitions. Complement of second has 17 states. [2024-10-25 00:35:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2024-10-25 00:35:41,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 116 letters. Loop has 4 letters. [2024-10-25 00:35:41,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:41,476 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:35:41,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:41,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-25 00:35:41,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:42,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:35:42,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:42,292 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-25 00:35:42,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:42,342 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 425 states and 667 transitions. Complement of second has 21 states. [2024-10-25 00:35:42,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-25 00:35:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2024-10-25 00:35:42,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 116 letters. Loop has 4 letters. [2024-10-25 00:35:42,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:42,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 120 letters. Loop has 4 letters. [2024-10-25 00:35:42,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:42,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 116 letters. Loop has 8 letters. [2024-10-25 00:35:42,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:42,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 425 states and 667 transitions. [2024-10-25 00:35:42,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-25 00:35:42,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 425 states to 362 states and 576 transitions. [2024-10-25 00:35:42,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2024-10-25 00:35:42,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2024-10-25 00:35:42,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 362 states and 576 transitions. [2024-10-25 00:35:42,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:42,366 INFO L218 hiAutomatonCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-10-25 00:35:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states and 576 transitions. [2024-10-25 00:35:42,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-10-25 00:35:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 225 states have (on average 1.1511111111111112) internal successors, (259), 225 states have internal predecessors, (259), 83 states have call successors, (99), 48 states have call predecessors, (99), 54 states have return successors, (218), 88 states have call predecessors, (218), 81 states have call successors, (218) [2024-10-25 00:35:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 576 transitions. [2024-10-25 00:35:42,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-10-25 00:35:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:35:42,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-25 00:35:42,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2024-10-25 00:35:42,380 INFO L87 Difference]: Start difference. First operand 362 states and 576 transitions. Second operand has 24 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 19 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (23), 10 states have call predecessors, (23), 15 states have call successors, (23) [2024-10-25 00:35:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:35:42,589 INFO L93 Difference]: Finished difference Result 542 states and 862 transitions. [2024-10-25 00:35:42,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 542 states and 862 transitions. [2024-10-25 00:35:42,594 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:35:42,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 542 states to 0 states and 0 transitions. [2024-10-25 00:35:42,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:35:42,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:35:42,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:35:42,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:35:42,595 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:35:42,595 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:35:42,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-25 00:35:42,596 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:35:42,597 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-25 00:35:42,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-25 00:35:42,597 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:35:42,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-25 00:35:42,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.10 12:35:42 BoogieIcfgContainer [2024-10-25 00:35:42,604 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-25 00:35:42,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-25 00:35:42,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-25 00:35:42,605 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-25 00:35:42,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:35:25" (3/4) ... [2024-10-25 00:35:42,607 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-25 00:35:42,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-25 00:35:42,608 INFO L158 Benchmark]: Toolchain (without parser) took 17293.39ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 126.7MB in the beginning and 120.0MB in the end (delta: 6.8MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2024-10-25 00:35:42,609 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:35:42,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.75ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 115.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-25 00:35:42,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.28ms. Allocated memory is still 159.4MB. Free memory was 115.2MB in the beginning and 113.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:35:42,609 INFO L158 Benchmark]: Boogie Preprocessor took 24.49ms. Allocated memory is still 159.4MB. Free memory was 113.8MB in the beginning and 112.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-25 00:35:42,610 INFO L158 Benchmark]: RCFGBuilder took 284.81ms. Allocated memory is still 159.4MB. Free memory was 112.4MB in the beginning and 126.1MB in the end (delta: -13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-25 00:35:42,610 INFO L158 Benchmark]: BuchiAutomizer took 16698.92ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 126.1MB in the beginning and 120.0MB in the end (delta: 6.1MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. [2024-10-25 00:35:42,610 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 232.8MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:35:42,611 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.75ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 115.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.28ms. Allocated memory is still 159.4MB. Free memory was 115.2MB in the beginning and 113.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.49ms. Allocated memory is still 159.4MB. Free memory was 113.8MB in the beginning and 112.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 284.81ms. Allocated memory is still 159.4MB. Free memory was 112.4MB in the beginning and 126.1MB in the end (delta: -13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 16698.92ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 126.1MB in the beginning and 120.0MB in the end (delta: 6.1MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 232.8MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (5 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 5 locations. One deterministic module has affine ranking function n and consists of 11 locations. One nondeterministic module has affine ranking function n and consists of 11 locations. One nondeterministic module has affine ranking function \old(n) and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.6s and 7 iterations. TraceHistogramMax:20. Analysis of lassos took 8.1s. Construction of modules took 0.8s. Büchi inclusion checks took 7.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 260 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 16/46 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 489 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 441 mSDsluCounter, 478 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 287 mSDsCounter, 439 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 877 IncrementalHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 439 mSolverCounterUnsat, 191 mSDtfsCounter, 877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT4 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp82 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf112 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-25 00:35:42,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:42,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:43,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:43,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-25 00:35:43,448 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 Result: TRUE