./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci01-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci01-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:13:29,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:13:29,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:13:29,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:13:29,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:13:29,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:13:29,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:13:29,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:13:29,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:13:29,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:13:29,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:13:29,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:13:29,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:13:29,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:13:29,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:13:29,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:13:29,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:13:29,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:13:29,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:13:29,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:13:29,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:13:29,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:13:29,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:13:29,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:13:29,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:13:29,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:13:29,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:13:29,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:13:29,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:13:29,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:13:29,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:13:29,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:13:29,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:13:29,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:13:29,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:13:29,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:13:29,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:13:29,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:13:29,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:13:29,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:13:29,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:13:29,804 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:13:29,828 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:13:29,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:13:29,829 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:13:29,829 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:13:29,830 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:13:29,830 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:13:29,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:13:29,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:13:29,831 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:13:29,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:13:29,832 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:13:29,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:13:29,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:13:29,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:13:29,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:13:29,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:13:29,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:13:29,833 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:13:29,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:13:29,833 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:13:29,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:13:29,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:13:29,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:13:29,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:13:29,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:13:29,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:13:29,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:13:29,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:13:29,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:13:29,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:13:29,836 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:13:29,836 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:13:29,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:13:29,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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(G ! call(reach_error())) ) 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 -> 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 [2022-02-20 18:13:29,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:13:30,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:13:30,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:13:30,021 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:13:30,022 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:13:30,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci01-1.c [2022-02-20 18:13:30,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68bc7ab55/31a98e405fc648f5bc98eee604319c63/FLAG5ebeeb885 [2022-02-20 18:13:30,433 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:13:30,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c [2022-02-20 18:13:30,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68bc7ab55/31a98e405fc648f5bc98eee604319c63/FLAG5ebeeb885 [2022-02-20 18:13:30,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68bc7ab55/31a98e405fc648f5bc98eee604319c63 [2022-02-20 18:13:30,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:13:30,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:13:30,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:13:30,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:13:30,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:13:30,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e4ff07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30, skipping insertion in model container [2022-02-20 18:13:30,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:13:30,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:13:30,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2022-02-20 18:13:30,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:13:30,671 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:13:30,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2022-02-20 18:13:30,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:13:30,700 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:13:30,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30 WrapperNode [2022-02-20 18:13:30,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:13:30,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:13:30,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:13:30,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:13:30,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,725 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-02-20 18:13:30,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:13:30,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:13:30,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:13:30,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:13:30,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:13:30,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:13:30,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:13:30,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:13:30,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30" (1/1) ... [2022-02-20 18:13:30,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:13:30,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:30,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:13:30,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:13:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-02-20 18:13:30,799 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-02-20 18:13:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:13:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:13:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:13:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:13:30,841 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:13:30,843 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:13:30,968 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:13:30,972 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:13:30,973 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:13:30,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:30 BoogieIcfgContainer [2022-02-20 18:13:30,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:13:30,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:13:30,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:13:30,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:13:30,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:13:30" (1/3) ... [2022-02-20 18:13:30,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509a5790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:13:30, skipping insertion in model container [2022-02-20 18:13:30,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:30" (2/3) ... [2022-02-20 18:13:30,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509a5790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:13:30, skipping insertion in model container [2022-02-20 18:13:30,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:30" (3/3) ... [2022-02-20 18:13:30,979 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2022-02-20 18:13:30,983 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:13:30,983 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:13:31,013 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:13:31,018 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:13:31,018 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:13:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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) [2022-02-20 18:13:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 18:13:31,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:31,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:31,048 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1939714822, now seen corresponding path program 1 times [2022-02-20 18:13:31,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:31,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71117532] [2022-02-20 18:13:31,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:31,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} ~n := #in~n; {31#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:31,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {32#(and (<= |fibonacci_#in~n| 0) (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-20 18:13:31,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#(and (<= |fibonacci_#in~n| 0) (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {32#(and (<= |fibonacci_#in~n| 0) (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-20 18:13:31,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#(and (<= |fibonacci_#in~n| 0) (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {23#true} #40#return; {29#(and (= |ULTIMATE.start_main_#t~ret7#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 18:13:31,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-02-20 18:13:31,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {23#true} is VALID [2022-02-20 18:13:31,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {23#true} is VALID [2022-02-20 18:13:31,381 INFO L272 TraceCheckUtils]: 3: Hoare triple {23#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {23#true} is VALID [2022-02-20 18:13:31,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {23#true} ~n := #in~n; {31#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:31,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {32#(and (<= |fibonacci_#in~n| 0) (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-20 18:13:31,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#(and (<= |fibonacci_#in~n| 0) (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {32#(and (<= |fibonacci_#in~n| 0) (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-20 18:13:31,384 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32#(and (<= |fibonacci_#in~n| 0) (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {23#true} #40#return; {29#(and (= |ULTIMATE.start_main_#t~ret7#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 18:13:31,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(and (= |ULTIMATE.start_main_#t~ret7#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {30#(and (= |ULTIMATE.start_main_~result~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 18:13:31,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(and (= |ULTIMATE.start_main_~result~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {24#false} is VALID [2022-02-20 18:13:31,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 18:13:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:13:31,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:31,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71117532] [2022-02-20 18:13:31,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71117532] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:13:31,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:13:31,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:13:31,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607319420] [2022-02-20 18:13:31,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:13:31,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 18:13:31,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:31,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:31,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:31,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:13:31,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:31,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:13:31,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:13:31,442 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:31,640 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 18:13:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:13:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 18:13:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 18:13:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 18:13:31,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-02-20 18:13:31,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:31,692 INFO L225 Difference]: With dead ends: 32 [2022-02-20 18:13:31,692 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 18:13:31,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:13:31,697 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:31,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 59 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:13:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 18:13:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 18:13:31,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:31,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:31,717 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:31,717 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:31,720 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-20 18:13:31,720 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 18:13:31,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:31,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:31,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 19 states. [2022-02-20 18:13:31,721 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 19 states. [2022-02-20 18:13:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:31,723 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-20 18:13:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 18:13:31,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:31,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:31,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:31,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-20 18:13:31,727 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2022-02-20 18:13:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:31,728 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-20 18:13:31,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 18:13:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 18:13:31,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:31,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:31,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:13:31,729 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:31,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash 692912656, now seen corresponding path program 1 times [2022-02-20 18:13:31,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:31,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401668078] [2022-02-20 18:13:31,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:31,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:31,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#true} ~n := #in~n; {146#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:31,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {146#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:31,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {147#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:31,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {147#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} assume true; {147#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:31,819 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {147#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} {137#true} #40#return; {144#(and (= |ULTIMATE.start_main_#t~ret7#1| 1) (<= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 18:13:31,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {137#true} is VALID [2022-02-20 18:13:31,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {137#true} is VALID [2022-02-20 18:13:31,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {137#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {137#true} is VALID [2022-02-20 18:13:31,820 INFO L272 TraceCheckUtils]: 3: Hoare triple {137#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {137#true} is VALID [2022-02-20 18:13:31,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {137#true} ~n := #in~n; {146#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:31,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {146#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:31,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {147#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:31,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {147#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} assume true; {147#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:31,822 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {147#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} {137#true} #40#return; {144#(and (= |ULTIMATE.start_main_#t~ret7#1| 1) (<= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 18:13:31,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {144#(and (= |ULTIMATE.start_main_#t~ret7#1| 1) (<= |ULTIMATE.start_main_~x~0#1| 1))} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {145#(and (= (+ (- 1) |ULTIMATE.start_main_~result~0#1|) 0) (<= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 18:13:31,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {145#(and (= (+ (- 1) |ULTIMATE.start_main_~result~0#1|) 0) (<= |ULTIMATE.start_main_~x~0#1| 1))} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {138#false} is VALID [2022-02-20 18:13:31,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {138#false} assume !false; {138#false} is VALID [2022-02-20 18:13:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:13:31,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:31,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401668078] [2022-02-20 18:13:31,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401668078] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:13:31,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:13:31,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:13:31,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164494261] [2022-02-20 18:13:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:13:31,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 18:13:31,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:31,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:31,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:31,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:13:31,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:31,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:13:31,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:13:31,837 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:31,958 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 18:13:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:13:31,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 18:13:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-02-20 18:13:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-02-20 18:13:31,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-02-20 18:13:31,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:31,984 INFO L225 Difference]: With dead ends: 25 [2022-02-20 18:13:31,984 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 18:13:31,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:13:31,986 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:31,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:13:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 18:13:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-02-20 18:13:31,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:31,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:31,989 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:31,990 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:31,991 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-20 18:13:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-20 18:13:31,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:31,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:31,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 21 states. [2022-02-20 18:13:31,993 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 21 states. [2022-02-20 18:13:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:31,994 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-20 18:13:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-20 18:13:31,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:31,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:31,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:31,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-20 18:13:31,997 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-02-20 18:13:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:31,997 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-20 18:13:31,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 18:13:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 18:13:31,998 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:31,998 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:31,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:13:31,999 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:31,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash 453332055, now seen corresponding path program 1 times [2022-02-20 18:13:31,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:32,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735795462] [2022-02-20 18:13:32,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:32,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:32,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} ~n := #in~n; {275#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:32,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {276#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:32,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#(<= |fibonacci_#in~n| 0)} assume true; {276#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:32,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#(<= |fibonacci_#in~n| 0)} {266#(not (<= fibonacci_~n 1))} #36#return; {247#false} is VALID [2022-02-20 18:13:32,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 18:13:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:32,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} ~n := #in~n; {246#true} is VALID [2022-02-20 18:13:32,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} assume ~n < 1;#res := 0; {246#true} is VALID [2022-02-20 18:13:32,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-02-20 18:13:32,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {247#false} #38#return; {247#false} is VALID [2022-02-20 18:13:32,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} ~n := #in~n; {246#true} is VALID [2022-02-20 18:13:32,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} assume !(~n < 1); {265#(< 0 fibonacci_~n)} is VALID [2022-02-20 18:13:32,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {265#(< 0 fibonacci_~n)} assume !(1 == ~n); {266#(not (<= fibonacci_~n 1))} is VALID [2022-02-20 18:13:32,089 INFO L272 TraceCheckUtils]: 3: Hoare triple {266#(not (<= fibonacci_~n 1))} call #t~ret4 := fibonacci(~n - 1); {246#true} is VALID [2022-02-20 18:13:32,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {246#true} ~n := #in~n; {275#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:32,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {276#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:32,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(<= |fibonacci_#in~n| 0)} assume true; {276#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:32,091 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {276#(<= |fibonacci_#in~n| 0)} {266#(not (<= fibonacci_~n 1))} #36#return; {247#false} is VALID [2022-02-20 18:13:32,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {247#false} is VALID [2022-02-20 18:13:32,091 INFO L272 TraceCheckUtils]: 9: Hoare triple {247#false} call #t~ret5 := fibonacci(~n - 2); {246#true} is VALID [2022-02-20 18:13:32,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {246#true} ~n := #in~n; {246#true} is VALID [2022-02-20 18:13:32,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {246#true} assume ~n < 1;#res := 0; {246#true} is VALID [2022-02-20 18:13:32,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} assume true; {246#true} is VALID [2022-02-20 18:13:32,092 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {246#true} {247#false} #38#return; {247#false} is VALID [2022-02-20 18:13:32,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {247#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {247#false} is VALID [2022-02-20 18:13:32,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {247#false} assume true; {247#false} is VALID [2022-02-20 18:13:32,093 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {247#false} {246#true} #40#return; {247#false} is VALID [2022-02-20 18:13:32,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-02-20 18:13:32,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {246#true} is VALID [2022-02-20 18:13:32,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {246#true} is VALID [2022-02-20 18:13:32,094 INFO L272 TraceCheckUtils]: 3: Hoare triple {246#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {246#true} is VALID [2022-02-20 18:13:32,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {246#true} ~n := #in~n; {246#true} is VALID [2022-02-20 18:13:32,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} assume !(~n < 1); {265#(< 0 fibonacci_~n)} is VALID [2022-02-20 18:13:32,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {265#(< 0 fibonacci_~n)} assume !(1 == ~n); {266#(not (<= fibonacci_~n 1))} is VALID [2022-02-20 18:13:32,095 INFO L272 TraceCheckUtils]: 7: Hoare triple {266#(not (<= fibonacci_~n 1))} call #t~ret4 := fibonacci(~n - 1); {246#true} is VALID [2022-02-20 18:13:32,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} ~n := #in~n; {275#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:32,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {275#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {276#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:32,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {276#(<= |fibonacci_#in~n| 0)} assume true; {276#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:32,098 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {276#(<= |fibonacci_#in~n| 0)} {266#(not (<= fibonacci_~n 1))} #36#return; {247#false} is VALID [2022-02-20 18:13:32,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {247#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {247#false} is VALID [2022-02-20 18:13:32,098 INFO L272 TraceCheckUtils]: 13: Hoare triple {247#false} call #t~ret5 := fibonacci(~n - 2); {246#true} is VALID [2022-02-20 18:13:32,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} ~n := #in~n; {246#true} is VALID [2022-02-20 18:13:32,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {246#true} assume ~n < 1;#res := 0; {246#true} is VALID [2022-02-20 18:13:32,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} assume true; {246#true} is VALID [2022-02-20 18:13:32,099 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {246#true} {247#false} #38#return; {247#false} is VALID [2022-02-20 18:13:32,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {247#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {247#false} is VALID [2022-02-20 18:13:32,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {247#false} assume true; {247#false} is VALID [2022-02-20 18:13:32,099 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {247#false} {246#true} #40#return; {247#false} is VALID [2022-02-20 18:13:32,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {247#false} is VALID [2022-02-20 18:13:32,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {247#false} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {247#false} is VALID [2022-02-20 18:13:32,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-02-20 18:13:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 18:13:32,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:32,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735795462] [2022-02-20 18:13:32,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735795462] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:32,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768402860] [2022-02-20 18:13:32,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:32,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:32,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:32,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:32,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:13:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:32,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 18:13:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:32,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:32,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-02-20 18:13:32,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {246#true} is VALID [2022-02-20 18:13:32,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {246#true} is VALID [2022-02-20 18:13:32,472 INFO L272 TraceCheckUtils]: 3: Hoare triple {246#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {246#true} is VALID [2022-02-20 18:13:32,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {246#true} ~n := #in~n; {292#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:32,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {292#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:32,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {292#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:32,473 INFO L272 TraceCheckUtils]: 7: Hoare triple {292#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {246#true} is VALID [2022-02-20 18:13:32,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} ~n := #in~n; {292#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:32,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {308#(and (< |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} is VALID [2022-02-20 18:13:32,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {308#(and (< |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} assume true; {308#(and (< |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} is VALID [2022-02-20 18:13:32,475 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {308#(and (< |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} {292#(<= |fibonacci_#in~n| fibonacci_~n)} #36#return; {315#(and (< |fibonacci_#in~n| 2) (<= 0 |fibonacci_#t~ret4|))} is VALID [2022-02-20 18:13:32,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(and (< |fibonacci_#in~n| 2) (<= 0 |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {315#(and (< |fibonacci_#in~n| 2) (<= 0 |fibonacci_#t~ret4|))} is VALID [2022-02-20 18:13:32,476 INFO L272 TraceCheckUtils]: 13: Hoare triple {315#(and (< |fibonacci_#in~n| 2) (<= 0 |fibonacci_#t~ret4|))} call #t~ret5 := fibonacci(~n - 2); {246#true} is VALID [2022-02-20 18:13:32,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} ~n := #in~n; {246#true} is VALID [2022-02-20 18:13:32,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {246#true} assume ~n < 1;#res := 0; {328#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:32,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {328#(<= 0 |fibonacci_#res|)} assume true; {328#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:32,478 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {328#(<= 0 |fibonacci_#res|)} {315#(and (< |fibonacci_#in~n| 2) (<= 0 |fibonacci_#t~ret4|))} #38#return; {335#(and (< |fibonacci_#in~n| 2) (<= 0 |fibonacci_#t~ret5|) (<= 0 |fibonacci_#t~ret4|))} is VALID [2022-02-20 18:13:32,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {335#(and (< |fibonacci_#in~n| 2) (<= 0 |fibonacci_#t~ret5|) (<= 0 |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {339#(and (< |fibonacci_#in~n| 2) (<= 0 |fibonacci_#res|))} is VALID [2022-02-20 18:13:32,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {339#(and (< |fibonacci_#in~n| 2) (<= 0 |fibonacci_#res|))} assume true; {339#(and (< |fibonacci_#in~n| 2) (<= 0 |fibonacci_#res|))} is VALID [2022-02-20 18:13:32,480 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {339#(and (< |fibonacci_#in~n| 2) (<= 0 |fibonacci_#res|))} {246#true} #40#return; {346#(and (< |ULTIMATE.start_main_~x~0#1| 2) (<= 0 |ULTIMATE.start_main_#t~ret7#1|))} is VALID [2022-02-20 18:13:32,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {346#(and (< |ULTIMATE.start_main_~x~0#1| 2) (<= 0 |ULTIMATE.start_main_#t~ret7#1|))} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {350#(and (< |ULTIMATE.start_main_~x~0#1| 2) (<= 0 |ULTIMATE.start_main_~result~0#1|))} is VALID [2022-02-20 18:13:32,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {350#(and (< |ULTIMATE.start_main_~x~0#1| 2) (<= 0 |ULTIMATE.start_main_~result~0#1|))} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {247#false} is VALID [2022-02-20 18:13:32,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-02-20 18:13:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 18:13:32,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:33,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-02-20 18:13:33,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {360#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~result~0#1| 1))} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {247#false} is VALID [2022-02-20 18:13:33,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {364#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {360#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~result~0#1| 1))} is VALID [2022-02-20 18:13:33,522 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {371#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {246#true} #40#return; {364#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} is VALID [2022-02-20 18:13:33,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {371#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {371#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:33,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {378#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {371#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:33,524 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {328#(<= 0 |fibonacci_#res|)} {382#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1))} #38#return; {378#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:33,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {328#(<= 0 |fibonacci_#res|)} assume true; {328#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:33,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {246#true} assume ~n < 1;#res := 0; {328#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:33,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} ~n := #in~n; {246#true} is VALID [2022-02-20 18:13:33,525 INFO L272 TraceCheckUtils]: 13: Hoare triple {382#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1))} call #t~ret5 := fibonacci(~n - 2); {246#true} is VALID [2022-02-20 18:13:33,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {382#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {382#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:33,526 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {308#(and (< |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} {401#(or (<= |fibonacci_#in~n| 1) (<= 2 fibonacci_~n))} #36#return; {382#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:33,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {308#(and (< |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} assume true; {308#(and (< |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} is VALID [2022-02-20 18:13:33,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {411#(or (< |fibonacci_#in~n| 1) (<= 1 fibonacci_~n))} assume ~n < 1;#res := 0; {308#(and (< |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} is VALID [2022-02-20 18:13:33,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} ~n := #in~n; {411#(or (< |fibonacci_#in~n| 1) (<= 1 fibonacci_~n))} is VALID [2022-02-20 18:13:33,540 INFO L272 TraceCheckUtils]: 7: Hoare triple {401#(or (<= |fibonacci_#in~n| 1) (<= 2 fibonacci_~n))} call #t~ret4 := fibonacci(~n - 1); {246#true} is VALID [2022-02-20 18:13:33,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {401#(or (<= |fibonacci_#in~n| 1) (<= 2 fibonacci_~n))} assume !(1 == ~n); {401#(or (<= |fibonacci_#in~n| 1) (<= 2 fibonacci_~n))} is VALID [2022-02-20 18:13:33,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {401#(or (<= |fibonacci_#in~n| 1) (<= 2 fibonacci_~n))} assume !(~n < 1); {401#(or (<= |fibonacci_#in~n| 1) (<= 2 fibonacci_~n))} is VALID [2022-02-20 18:13:33,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {246#true} ~n := #in~n; {401#(or (<= |fibonacci_#in~n| 1) (<= 2 fibonacci_~n))} is VALID [2022-02-20 18:13:33,541 INFO L272 TraceCheckUtils]: 3: Hoare triple {246#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {246#true} is VALID [2022-02-20 18:13:33,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {246#true} is VALID [2022-02-20 18:13:33,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {246#true} is VALID [2022-02-20 18:13:33,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-02-20 18:13:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 18:13:33,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768402860] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:33,542 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:33,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 21 [2022-02-20 18:13:33,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817166788] [2022-02-20 18:13:33,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:33,543 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2022-02-20 18:13:33,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:33,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:13:33,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:33,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 18:13:33,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:33,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 18:13:33,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:13:33,581 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:13:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:33,950 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-02-20 18:13:33,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:13:33,950 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2022-02-20 18:13:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:13:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-02-20 18:13:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:13:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-02-20 18:13:33,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-02-20 18:13:33,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:33,988 INFO L225 Difference]: With dead ends: 36 [2022-02-20 18:13:33,988 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 18:13:33,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:13:33,991 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:33,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 112 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:13:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 18:13:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 18:13:33,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:33,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 18:13:33,996 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 18:13:33,996 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 18:13:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:34,000 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 18:13:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 18:13:34,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:34,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:34,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Second operand 21 states. [2022-02-20 18:13:34,001 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Second operand 21 states. [2022-02-20 18:13:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:34,003 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 18:13:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 18:13:34,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:34,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:34,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:34,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 18:13:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-20 18:13:34,006 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 24 [2022-02-20 18:13:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:34,006 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-20 18:13:34,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:13:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 18:13:34,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:13:34,009 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:34,009 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:34,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 18:13:34,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:34,219 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1064754479, now seen corresponding path program 1 times [2022-02-20 18:13:34,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:34,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781061358] [2022-02-20 18:13:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:34,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:34,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:34,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#true} ~n := #in~n; {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,360 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} {574#(= fibonacci_~n |fibonacci_#in~n|)} #36#return; {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:34,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:13:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:34,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#true} ~n := #in~n; {552#true} is VALID [2022-02-20 18:13:34,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {552#true} assume ~n < 1;#res := 0; {588#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#(<= 0 |fibonacci_#res|)} assume true; {588#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#(<= 0 |fibonacci_#res|)} {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {585#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:34,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#true} ~n := #in~n; {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,384 INFO L272 TraceCheckUtils]: 3: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {552#true} is VALID [2022-02-20 18:13:34,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {552#true} ~n := #in~n; {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,386 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} {574#(= fibonacci_~n |fibonacci_#in~n|)} #36#return; {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:34,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:34,387 INFO L272 TraceCheckUtils]: 10: Hoare triple {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {552#true} is VALID [2022-02-20 18:13:34,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {552#true} ~n := #in~n; {552#true} is VALID [2022-02-20 18:13:34,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {552#true} assume ~n < 1;#res := 0; {588#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= 0 |fibonacci_#res|)} assume true; {588#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,388 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {588#(<= 0 |fibonacci_#res|)} {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {585#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:34,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {585#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:34,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:34,390 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {552#true} #40#return; {572#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} is VALID [2022-02-20 18:13:34,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {552#true} is VALID [2022-02-20 18:13:34,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {552#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {552#true} is VALID [2022-02-20 18:13:34,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {552#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {552#true} is VALID [2022-02-20 18:13:34,391 INFO L272 TraceCheckUtils]: 3: Hoare triple {552#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {552#true} is VALID [2022-02-20 18:13:34,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {552#true} ~n := #in~n; {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,392 INFO L272 TraceCheckUtils]: 7: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {552#true} is VALID [2022-02-20 18:13:34,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {552#true} ~n := #in~n; {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {574#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:34,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {574#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,394 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {587#(<= |fibonacci_#in~n| |fibonacci_#res|)} {574#(= fibonacci_~n |fibonacci_#in~n|)} #36#return; {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:34,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:34,395 INFO L272 TraceCheckUtils]: 14: Hoare triple {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {552#true} is VALID [2022-02-20 18:13:34,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {552#true} ~n := #in~n; {552#true} is VALID [2022-02-20 18:13:34,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {552#true} assume ~n < 1;#res := 0; {588#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {588#(<= 0 |fibonacci_#res|)} assume true; {588#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,396 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {588#(<= 0 |fibonacci_#res|)} {580#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {585#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:34,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {585#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:34,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:34,398 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {552#true} #40#return; {572#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} is VALID [2022-02-20 18:13:34,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {572#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {573#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~result~0#1| 1))} is VALID [2022-02-20 18:13:34,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {573#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~result~0#1| 1))} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {553#false} is VALID [2022-02-20 18:13:34,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {553#false} assume !false; {553#false} is VALID [2022-02-20 18:13:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 18:13:34,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:34,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781061358] [2022-02-20 18:13:34,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781061358] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:34,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221528579] [2022-02-20 18:13:34,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:34,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:34,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:34,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:34,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 18:13:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:34,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 18:13:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:34,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:34,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {552#true} is VALID [2022-02-20 18:13:34,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {552#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {552#true} is VALID [2022-02-20 18:13:34,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {552#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {552#true} is VALID [2022-02-20 18:13:34,765 INFO L272 TraceCheckUtils]: 3: Hoare triple {552#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {552#true} is VALID [2022-02-20 18:13:34,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {552#true} ~n := #in~n; {604#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:34,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {604#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:34,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {604#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {604#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:34,767 INFO L272 TraceCheckUtils]: 7: Hoare triple {604#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {552#true} is VALID [2022-02-20 18:13:34,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {552#true} ~n := #in~n; {604#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:34,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {604#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:34,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {604#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {623#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:34,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} assume true; {623#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:34,769 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {623#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} {604#(<= |fibonacci_#in~n| fibonacci_~n)} #36#return; {630#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-20 18:13:34,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {630#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-20 18:13:34,770 INFO L272 TraceCheckUtils]: 14: Hoare triple {630#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| 2))} call #t~ret5 := fibonacci(~n - 2); {552#true} is VALID [2022-02-20 18:13:34,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {552#true} ~n := #in~n; {552#true} is VALID [2022-02-20 18:13:34,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {552#true} assume ~n < 1;#res := 0; {588#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {588#(<= 0 |fibonacci_#res|)} assume true; {588#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:34,772 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {588#(<= 0 |fibonacci_#res|)} {630#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| 2))} #38#return; {649#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| 2) (<= 0 |fibonacci_#t~ret5|))} is VALID [2022-02-20 18:13:34,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {649#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| 2) (<= 0 |fibonacci_#t~ret5|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {653#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-20 18:13:34,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} assume true; {653#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-20 18:13:34,773 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} {552#true} #40#return; {660#(and (<= 1 |ULTIMATE.start_main_#t~ret7#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 18:13:34,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#(and (<= 1 |ULTIMATE.start_main_#t~ret7#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {664#(and (<= 1 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 18:13:34,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {664#(and (<= 1 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {553#false} is VALID [2022-02-20 18:13:34,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {553#false} assume !false; {553#false} is VALID [2022-02-20 18:13:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 18:13:34,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:35,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {553#false} assume !false; {553#false} is VALID [2022-02-20 18:13:35,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {573#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~result~0#1| 1))} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {553#false} is VALID [2022-02-20 18:13:35,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {572#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {573#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~result~0#1| 1))} is VALID [2022-02-20 18:13:35,721 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {552#true} #40#return; {572#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} is VALID [2022-02-20 18:13:35,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:35,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {585#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {586#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:35,723 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {588#(<= 0 |fibonacci_#res|)} {692#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1))} #38#return; {585#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:35,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {588#(<= 0 |fibonacci_#res|)} assume true; {588#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:35,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {552#true} assume ~n < 1;#res := 0; {588#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:35,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {552#true} ~n := #in~n; {552#true} is VALID [2022-02-20 18:13:35,725 INFO L272 TraceCheckUtils]: 14: Hoare triple {692#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1))} call #t~ret5 := fibonacci(~n - 2); {552#true} is VALID [2022-02-20 18:13:35,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {692#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {692#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:35,726 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {623#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} {711#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #36#return; {692#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:35,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} assume true; {623#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:35,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {721#(or (<= |fibonacci_#in~n| 1) (< 1 fibonacci_~n))} assume 1 == ~n;#res := 1; {623#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:35,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {721#(or (<= |fibonacci_#in~n| 1) (< 1 fibonacci_~n))} assume !(~n < 1); {721#(or (<= |fibonacci_#in~n| 1) (< 1 fibonacci_~n))} is VALID [2022-02-20 18:13:35,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {552#true} ~n := #in~n; {721#(or (<= |fibonacci_#in~n| 1) (< 1 fibonacci_~n))} is VALID [2022-02-20 18:13:35,727 INFO L272 TraceCheckUtils]: 7: Hoare triple {711#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {552#true} is VALID [2022-02-20 18:13:35,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {711#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {711#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-20 18:13:35,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {711#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {711#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-20 18:13:35,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {552#true} ~n := #in~n; {711#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-20 18:13:35,729 INFO L272 TraceCheckUtils]: 3: Hoare triple {552#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {552#true} is VALID [2022-02-20 18:13:35,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {552#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {552#true} is VALID [2022-02-20 18:13:35,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {552#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {552#true} is VALID [2022-02-20 18:13:35,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {552#true} is VALID [2022-02-20 18:13:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 18:13:35,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221528579] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:35,730 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:35,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2022-02-20 18:13:35,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971902012] [2022-02-20 18:13:35,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:35,731 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 25 [2022-02-20 18:13:35,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:35,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 18:13:35,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:35,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 18:13:35,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:35,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 18:13:35,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:13:35,765 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 18:13:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:36,227 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 18:13:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:13:36,228 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 25 [2022-02-20 18:13:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 18:13:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-02-20 18:13:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 18:13:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-02-20 18:13:36,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 41 transitions. [2022-02-20 18:13:36,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:36,260 INFO L225 Difference]: With dead ends: 32 [2022-02-20 18:13:36,261 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 18:13:36,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-02-20 18:13:36,262 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:36,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 89 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:13:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 18:13:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-02-20 18:13:36,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:36,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:13:36,268 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:13:36,268 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:13:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:36,270 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 18:13:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 18:13:36,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:36,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:36,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Second operand 28 states. [2022-02-20 18:13:36,271 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Second operand 28 states. [2022-02-20 18:13:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:36,272 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 18:13:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 18:13:36,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:36,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:36,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:36,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:13:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-02-20 18:13:36,275 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 25 [2022-02-20 18:13:36,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:36,275 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-02-20 18:13:36,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 18:13:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-02-20 18:13:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:13:36,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:36,276 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:36,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 18:13:36,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 18:13:36,499 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:36,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash 484916750, now seen corresponding path program 2 times [2022-02-20 18:13:36,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:36,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051386666] [2022-02-20 18:13:36,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:36,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#true} assume !(~n < 1); {882#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#true} assume 1 == ~n;#res := 1; {882#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {882#true} assume true; {882#true} is VALID [2022-02-20 18:13:36,589 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {882#true} {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:13:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#true} assume ~n < 1;#res := 0; {882#true} is VALID [2022-02-20 18:13:36,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#true} assume true; {882#true} is VALID [2022-02-20 18:13:36,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {882#true} {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} ~n := #in~n; {938#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {939#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {939#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,597 INFO L272 TraceCheckUtils]: 3: Hoare triple {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {882#true} is VALID [2022-02-20 18:13:36,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {882#true} assume !(~n < 1); {882#true} is VALID [2022-02-20 18:13:36,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {882#true} assume 1 == ~n;#res := 1; {882#true} is VALID [2022-02-20 18:13:36,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {882#true} assume true; {882#true} is VALID [2022-02-20 18:13:36,598 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {882#true} {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,599 INFO L272 TraceCheckUtils]: 10: Hoare triple {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {882#true} is VALID [2022-02-20 18:13:36,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {882#true} assume ~n < 1;#res := 0; {882#true} is VALID [2022-02-20 18:13:36,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {882#true} assume true; {882#true} is VALID [2022-02-20 18:13:36,600 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {882#true} {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume true; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,601 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {950#(<= 2 |fibonacci_#in~n|)} {882#true} #36#return; {933#(<= 3 fibonacci_~n)} is VALID [2022-02-20 18:13:36,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 18:13:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} ~n := #in~n; {938#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {951#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:36,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {951#(<= |fibonacci_#in~n| 0)} assume true; {951#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:36,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {951#(<= |fibonacci_#in~n| 0)} {933#(<= 3 fibonacci_~n)} #38#return; {883#false} is VALID [2022-02-20 18:13:36,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#true} assume !(~n < 1); {882#true} is VALID [2022-02-20 18:13:36,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#true} assume !(1 == ~n); {882#true} is VALID [2022-02-20 18:13:36,616 INFO L272 TraceCheckUtils]: 3: Hoare triple {882#true} call #t~ret4 := fibonacci(~n - 1); {882#true} is VALID [2022-02-20 18:13:36,616 INFO L290 TraceCheckUtils]: 4: Hoare triple {882#true} ~n := #in~n; {938#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {938#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {939#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {939#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,617 INFO L272 TraceCheckUtils]: 7: Hoare triple {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {882#true} is VALID [2022-02-20 18:13:36,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {882#true} assume !(~n < 1); {882#true} is VALID [2022-02-20 18:13:36,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {882#true} assume 1 == ~n;#res := 1; {882#true} is VALID [2022-02-20 18:13:36,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {882#true} assume true; {882#true} is VALID [2022-02-20 18:13:36,618 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {882#true} {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,619 INFO L272 TraceCheckUtils]: 14: Hoare triple {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {882#true} is VALID [2022-02-20 18:13:36,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#true} assume ~n < 1;#res := 0; {882#true} is VALID [2022-02-20 18:13:36,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#true} assume true; {882#true} is VALID [2022-02-20 18:13:36,620 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {882#true} {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume true; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,621 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {950#(<= 2 |fibonacci_#in~n|)} {882#true} #36#return; {933#(<= 3 fibonacci_~n)} is VALID [2022-02-20 18:13:36,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {933#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {933#(<= 3 fibonacci_~n)} is VALID [2022-02-20 18:13:36,621 INFO L272 TraceCheckUtils]: 23: Hoare triple {933#(<= 3 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {882#true} is VALID [2022-02-20 18:13:36,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {882#true} ~n := #in~n; {938#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {938#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {951#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:36,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {951#(<= |fibonacci_#in~n| 0)} assume true; {951#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:36,623 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {951#(<= |fibonacci_#in~n| 0)} {933#(<= 3 fibonacci_~n)} #38#return; {883#false} is VALID [2022-02-20 18:13:36,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {883#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {883#false} is VALID [2022-02-20 18:13:36,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {883#false} assume true; {883#false} is VALID [2022-02-20 18:13:36,624 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {883#false} {882#true} #40#return; {883#false} is VALID [2022-02-20 18:13:36,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {882#true} is VALID [2022-02-20 18:13:36,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {882#true} is VALID [2022-02-20 18:13:36,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {882#true} is VALID [2022-02-20 18:13:36,624 INFO L272 TraceCheckUtils]: 3: Hoare triple {882#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {882#true} is VALID [2022-02-20 18:13:36,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {882#true} assume !(~n < 1); {882#true} is VALID [2022-02-20 18:13:36,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {882#true} assume !(1 == ~n); {882#true} is VALID [2022-02-20 18:13:36,625 INFO L272 TraceCheckUtils]: 7: Hoare triple {882#true} call #t~ret4 := fibonacci(~n - 1); {882#true} is VALID [2022-02-20 18:13:36,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#true} ~n := #in~n; {938#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {938#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {939#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {939#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,627 INFO L272 TraceCheckUtils]: 11: Hoare triple {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {882#true} is VALID [2022-02-20 18:13:36,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {882#true} assume !(~n < 1); {882#true} is VALID [2022-02-20 18:13:36,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {882#true} assume 1 == ~n;#res := 1; {882#true} is VALID [2022-02-20 18:13:36,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {882#true} assume true; {882#true} is VALID [2022-02-20 18:13:36,628 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {882#true} {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:36,628 INFO L272 TraceCheckUtils]: 18: Hoare triple {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {882#true} is VALID [2022-02-20 18:13:36,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {882#true} assume ~n < 1;#res := 0; {882#true} is VALID [2022-02-20 18:13:36,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {882#true} assume true; {882#true} is VALID [2022-02-20 18:13:36,630 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {882#true} {940#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume true; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,631 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {950#(<= 2 |fibonacci_#in~n|)} {882#true} #36#return; {933#(<= 3 fibonacci_~n)} is VALID [2022-02-20 18:13:36,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {933#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {933#(<= 3 fibonacci_~n)} is VALID [2022-02-20 18:13:36,631 INFO L272 TraceCheckUtils]: 27: Hoare triple {933#(<= 3 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {882#true} is VALID [2022-02-20 18:13:36,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {882#true} ~n := #in~n; {938#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {938#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {951#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:36,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {951#(<= |fibonacci_#in~n| 0)} assume true; {951#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:36,633 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {951#(<= |fibonacci_#in~n| 0)} {933#(<= 3 fibonacci_~n)} #38#return; {883#false} is VALID [2022-02-20 18:13:36,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {883#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {883#false} is VALID [2022-02-20 18:13:36,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {883#false} assume true; {883#false} is VALID [2022-02-20 18:13:36,633 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {883#false} {882#true} #40#return; {883#false} is VALID [2022-02-20 18:13:36,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {883#false} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {883#false} is VALID [2022-02-20 18:13:36,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {883#false} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {883#false} is VALID [2022-02-20 18:13:36,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {883#false} assume !false; {883#false} is VALID [2022-02-20 18:13:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-20 18:13:36,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:36,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051386666] [2022-02-20 18:13:36,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051386666] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:36,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55818182] [2022-02-20 18:13:36,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 18:13:36,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:36,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:36,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:36,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 18:13:36,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 18:13:36,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:13:36,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:13:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:36,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {882#true} is VALID [2022-02-20 18:13:36,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {882#true} is VALID [2022-02-20 18:13:36,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {882#true} is VALID [2022-02-20 18:13:36,850 INFO L272 TraceCheckUtils]: 3: Hoare triple {882#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {882#true} is VALID [2022-02-20 18:13:36,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {882#true} assume !(~n < 1); {882#true} is VALID [2022-02-20 18:13:36,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {882#true} assume !(1 == ~n); {882#true} is VALID [2022-02-20 18:13:36,850 INFO L272 TraceCheckUtils]: 7: Hoare triple {882#true} call #t~ret4 := fibonacci(~n - 1); {882#true} is VALID [2022-02-20 18:13:36,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#true} ~n := #in~n; {979#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {979#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {979#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {979#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {979#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,853 INFO L272 TraceCheckUtils]: 11: Hoare triple {979#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {882#true} is VALID [2022-02-20 18:13:36,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {882#true} ~n := #in~n; {979#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {979#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {995#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {995#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {995#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {995#(<= 1 |fibonacci_#in~n|)} assume true; {995#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,855 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {995#(<= 1 |fibonacci_#in~n|)} {979#(<= fibonacci_~n |fibonacci_#in~n|)} #36#return; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,855 INFO L272 TraceCheckUtils]: 18: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {882#true} is VALID [2022-02-20 18:13:36,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:36,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {882#true} assume ~n < 1;#res := 0; {882#true} is VALID [2022-02-20 18:13:36,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {882#true} assume true; {882#true} is VALID [2022-02-20 18:13:36,856 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {882#true} {950#(<= 2 |fibonacci_#in~n|)} #38#return; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume true; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:36,857 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {950#(<= 2 |fibonacci_#in~n|)} {882#true} #36#return; {933#(<= 3 fibonacci_~n)} is VALID [2022-02-20 18:13:36,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {933#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {933#(<= 3 fibonacci_~n)} is VALID [2022-02-20 18:13:36,857 INFO L272 TraceCheckUtils]: 27: Hoare triple {933#(<= 3 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {882#true} is VALID [2022-02-20 18:13:36,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {882#true} ~n := #in~n; {1041#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:36,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {1041#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {951#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:36,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {951#(<= |fibonacci_#in~n| 0)} assume true; {951#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:36,859 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {951#(<= |fibonacci_#in~n| 0)} {933#(<= 3 fibonacci_~n)} #38#return; {883#false} is VALID [2022-02-20 18:13:36,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {883#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {883#false} is VALID [2022-02-20 18:13:36,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {883#false} assume true; {883#false} is VALID [2022-02-20 18:13:36,859 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {883#false} {882#true} #40#return; {883#false} is VALID [2022-02-20 18:13:36,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {883#false} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {883#false} is VALID [2022-02-20 18:13:36,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {883#false} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {883#false} is VALID [2022-02-20 18:13:36,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {883#false} assume !false; {883#false} is VALID [2022-02-20 18:13:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 18:13:36,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:37,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {883#false} assume !false; {883#false} is VALID [2022-02-20 18:13:37,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {883#false} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {883#false} is VALID [2022-02-20 18:13:37,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {883#false} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {883#false} is VALID [2022-02-20 18:13:37,473 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {883#false} {882#true} #40#return; {883#false} is VALID [2022-02-20 18:13:37,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {883#false} assume true; {883#false} is VALID [2022-02-20 18:13:37,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {883#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {883#false} is VALID [2022-02-20 18:13:37,476 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {951#(<= |fibonacci_#in~n| 0)} {933#(<= 3 fibonacci_~n)} #38#return; {883#false} is VALID [2022-02-20 18:13:37,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {951#(<= |fibonacci_#in~n| 0)} assume true; {951#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:37,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {1099#(or (<= |fibonacci_#in~n| 0) (not (< fibonacci_~n 1)))} assume ~n < 1;#res := 0; {951#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-20 18:13:37,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {882#true} ~n := #in~n; {1099#(or (<= |fibonacci_#in~n| 0) (not (< fibonacci_~n 1)))} is VALID [2022-02-20 18:13:37,478 INFO L272 TraceCheckUtils]: 27: Hoare triple {933#(<= 3 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {882#true} is VALID [2022-02-20 18:13:37,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {933#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {933#(<= 3 fibonacci_~n)} is VALID [2022-02-20 18:13:37,480 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {950#(<= 2 |fibonacci_#in~n|)} {882#true} #36#return; {933#(<= 3 fibonacci_~n)} is VALID [2022-02-20 18:13:37,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume true; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:37,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:37,482 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {882#true} {950#(<= 2 |fibonacci_#in~n|)} #38#return; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:37,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {882#true} assume true; {882#true} is VALID [2022-02-20 18:13:37,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {882#true} assume ~n < 1;#res := 0; {882#true} is VALID [2022-02-20 18:13:37,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:37,482 INFO L272 TraceCheckUtils]: 18: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {882#true} is VALID [2022-02-20 18:13:37,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {950#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:37,483 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {995#(<= 1 |fibonacci_#in~n|)} {1139#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} #36#return; {950#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:37,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {995#(<= 1 |fibonacci_#in~n|)} assume true; {995#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:37,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {995#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {995#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:37,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {1152#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {995#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:37,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {882#true} ~n := #in~n; {1152#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-20 18:13:37,485 INFO L272 TraceCheckUtils]: 11: Hoare triple {1139#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} call #t~ret4 := fibonacci(~n - 1); {882#true} is VALID [2022-02-20 18:13:37,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {1139#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(1 == ~n); {1139#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-20 18:13:37,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {1139#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(~n < 1); {1139#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-20 18:13:37,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#true} ~n := #in~n; {1139#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-20 18:13:37,485 INFO L272 TraceCheckUtils]: 7: Hoare triple {882#true} call #t~ret4 := fibonacci(~n - 1); {882#true} is VALID [2022-02-20 18:13:37,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {882#true} assume !(1 == ~n); {882#true} is VALID [2022-02-20 18:13:37,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {882#true} assume !(~n < 1); {882#true} is VALID [2022-02-20 18:13:37,486 INFO L290 TraceCheckUtils]: 4: Hoare triple {882#true} ~n := #in~n; {882#true} is VALID [2022-02-20 18:13:37,486 INFO L272 TraceCheckUtils]: 3: Hoare triple {882#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {882#true} is VALID [2022-02-20 18:13:37,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {882#true} is VALID [2022-02-20 18:13:37,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {882#true} is VALID [2022-02-20 18:13:37,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {882#true} is VALID [2022-02-20 18:13:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 18:13:37,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55818182] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:37,486 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:37,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 14 [2022-02-20 18:13:37,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296096754] [2022-02-20 18:13:37,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:37,487 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2022-02-20 18:13:37,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:37,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:13:37,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:37,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 18:13:37,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:37,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 18:13:37,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:13:37,524 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:13:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:37,665 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2022-02-20 18:13:37,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:13:37,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2022-02-20 18:13:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:13:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-02-20 18:13:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:13:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-02-20 18:13:37,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-02-20 18:13:37,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:37,700 INFO L225 Difference]: With dead ends: 53 [2022-02-20 18:13:37,700 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 18:13:37,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:13:37,705 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:37,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:13:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 18:13:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-02-20 18:13:37,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:37,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 18:13:37,719 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 18:13:37,719 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 18:13:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:37,731 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-02-20 18:13:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-02-20 18:13:37,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:37,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:37,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Second operand 31 states. [2022-02-20 18:13:37,733 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Second operand 31 states. [2022-02-20 18:13:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:37,737 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-02-20 18:13:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-02-20 18:13:37,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:37,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:37,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:37,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 18:13:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 18:13:37,746 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 38 [2022-02-20 18:13:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:37,747 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 18:13:37,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:13:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 18:13:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:13:37,748 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:37,748 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:37,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 18:13:37,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:37,948 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash 837439950, now seen corresponding path program 3 times [2022-02-20 18:13:37,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:37,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410369035] [2022-02-20 18:13:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:38,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:38,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:38,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {1346#true} ~n := #in~n; {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,114 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1382#(= fibonacci_~n |fibonacci_#in~n|)} #36#return; {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:13:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:38,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:38,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1346#true} assume ~n < 1;#res := 0; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {1420#(<= 0 |fibonacci_#res|)} assume true; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1420#(<= 0 |fibonacci_#res|)} {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:38,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {1346#true} ~n := #in~n; {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,131 INFO L272 TraceCheckUtils]: 3: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {1346#true} is VALID [2022-02-20 18:13:38,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {1346#true} ~n := #in~n; {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,133 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1382#(= fibonacci_~n |fibonacci_#in~n|)} #36#return; {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,133 INFO L272 TraceCheckUtils]: 10: Hoare triple {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {1346#true} is VALID [2022-02-20 18:13:38,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:38,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {1346#true} assume ~n < 1;#res := 0; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {1420#(<= 0 |fibonacci_#res|)} assume true; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,135 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1420#(<= 0 |fibonacci_#res|)} {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:38,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:38,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:38,137 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1382#(= fibonacci_~n |fibonacci_#in~n|)} #36#return; {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 18:13:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:38,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:38,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {1346#true} assume !(~n < 1); {1346#true} is VALID [2022-02-20 18:13:38,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {1346#true} assume 1 == ~n;#res := 1; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {1421#(<= 1 |fibonacci_#res|)} assume true; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,156 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1421#(<= 1 |fibonacci_#res|)} {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:38,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {1346#true} ~n := #in~n; {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,157 INFO L272 TraceCheckUtils]: 3: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {1346#true} is VALID [2022-02-20 18:13:38,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {1346#true} ~n := #in~n; {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,158 INFO L272 TraceCheckUtils]: 7: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {1346#true} is VALID [2022-02-20 18:13:38,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {1346#true} ~n := #in~n; {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,160 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1382#(= fibonacci_~n |fibonacci_#in~n|)} #36#return; {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,160 INFO L272 TraceCheckUtils]: 14: Hoare triple {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {1346#true} is VALID [2022-02-20 18:13:38,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:38,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {1346#true} assume ~n < 1;#res := 0; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {1420#(<= 0 |fibonacci_#res|)} assume true; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,162 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1420#(<= 0 |fibonacci_#res|)} {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:38,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:38,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:38,163 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1382#(= fibonacci_~n |fibonacci_#in~n|)} #36#return; {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,164 INFO L272 TraceCheckUtils]: 23: Hoare triple {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {1346#true} is VALID [2022-02-20 18:13:38,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:38,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {1346#true} assume !(~n < 1); {1346#true} is VALID [2022-02-20 18:13:38,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {1346#true} assume 1 == ~n;#res := 1; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {1421#(<= 1 |fibonacci_#res|)} assume true; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,165 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1421#(<= 1 |fibonacci_#res|)} {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:38,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:38,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:38,167 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1346#true} #40#return; {1380#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} is VALID [2022-02-20 18:13:38,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {1346#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1346#true} is VALID [2022-02-20 18:13:38,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {1346#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1346#true} is VALID [2022-02-20 18:13:38,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {1346#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {1346#true} is VALID [2022-02-20 18:13:38,167 INFO L272 TraceCheckUtils]: 3: Hoare triple {1346#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1346#true} is VALID [2022-02-20 18:13:38,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {1346#true} ~n := #in~n; {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,168 INFO L272 TraceCheckUtils]: 7: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {1346#true} is VALID [2022-02-20 18:13:38,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {1346#true} ~n := #in~n; {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,169 INFO L272 TraceCheckUtils]: 11: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {1346#true} is VALID [2022-02-20 18:13:38,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {1346#true} ~n := #in~n; {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1382#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-20 18:13:38,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {1382#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,171 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1419#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1382#(= fibonacci_~n |fibonacci_#in~n|)} #36#return; {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,172 INFO L272 TraceCheckUtils]: 18: Hoare triple {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {1346#true} is VALID [2022-02-20 18:13:38,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:38,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {1346#true} assume ~n < 1;#res := 0; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {1420#(<= 0 |fibonacci_#res|)} assume true; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,173 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1420#(<= 0 |fibonacci_#res|)} {1414#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:38,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:38,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:38,175 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1382#(= fibonacci_~n |fibonacci_#in~n|)} #36#return; {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-20 18:13:38,176 INFO L272 TraceCheckUtils]: 27: Hoare triple {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {1346#true} is VALID [2022-02-20 18:13:38,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:38,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {1346#true} assume !(~n < 1); {1346#true} is VALID [2022-02-20 18:13:38,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {1346#true} assume 1 == ~n;#res := 1; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {1421#(<= 1 |fibonacci_#res|)} assume true; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,179 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1421#(<= 1 |fibonacci_#res|)} {1401#(and (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #38#return; {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:38,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:38,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:38,182 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1346#true} #40#return; {1380#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} is VALID [2022-02-20 18:13:38,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {1380#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {1381#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~result~0#1| 1))} is VALID [2022-02-20 18:13:38,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {1381#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~result~0#1| 1))} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {1347#false} is VALID [2022-02-20 18:13:38,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {1347#false} assume !false; {1347#false} is VALID [2022-02-20 18:13:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 18:13:38,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:38,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410369035] [2022-02-20 18:13:38,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410369035] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:38,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318722190] [2022-02-20 18:13:38,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 18:13:38,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:38,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:38,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:38,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 18:13:38,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 18:13:38,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:13:38,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 18:13:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:38,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:38,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {1346#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1346#true} is VALID [2022-02-20 18:13:38,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1346#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1346#true} is VALID [2022-02-20 18:13:38,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {1346#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {1346#true} is VALID [2022-02-20 18:13:38,607 INFO L272 TraceCheckUtils]: 3: Hoare triple {1346#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1346#true} is VALID [2022-02-20 18:13:38,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {1346#true} ~n := #in~n; {1437#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:38,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {1437#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {1437#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:38,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {1437#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {1437#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:38,608 INFO L272 TraceCheckUtils]: 7: Hoare triple {1437#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {1346#true} is VALID [2022-02-20 18:13:38,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:38,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {1346#true} assume !(~n < 1); {1346#true} is VALID [2022-02-20 18:13:38,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {1346#true} assume !(1 == ~n); {1346#true} is VALID [2022-02-20 18:13:38,608 INFO L272 TraceCheckUtils]: 11: Hoare triple {1346#true} call #t~ret4 := fibonacci(~n - 1); {1346#true} is VALID [2022-02-20 18:13:38,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:38,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {1346#true} assume !(~n < 1); {1346#true} is VALID [2022-02-20 18:13:38,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {1346#true} assume 1 == ~n;#res := 1; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {1421#(<= 1 |fibonacci_#res|)} assume true; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,610 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1421#(<= 1 |fibonacci_#res|)} {1346#true} #36#return; {1474#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-20 18:13:38,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {1474#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1474#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-20 18:13:38,610 INFO L272 TraceCheckUtils]: 18: Hoare triple {1474#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {1346#true} is VALID [2022-02-20 18:13:38,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:38,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {1346#true} assume ~n < 1;#res := 0; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {1420#(<= 0 |fibonacci_#res|)} assume true; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,612 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1420#(<= 0 |fibonacci_#res|)} {1474#(<= 1 |fibonacci_#t~ret4|)} #38#return; {1493#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} is VALID [2022-02-20 18:13:38,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {1493#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {1421#(<= 1 |fibonacci_#res|)} assume true; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:38,613 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1421#(<= 1 |fibonacci_#res|)} {1437#(<= |fibonacci_#in~n| fibonacci_~n)} #36#return; {1503#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| fibonacci_~n))} is VALID [2022-02-20 18:13:38,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {1503#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| fibonacci_~n))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1503#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| fibonacci_~n))} is VALID [2022-02-20 18:13:38,614 INFO L272 TraceCheckUtils]: 27: Hoare triple {1503#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| fibonacci_~n))} call #t~ret5 := fibonacci(~n - 2); {1346#true} is VALID [2022-02-20 18:13:38,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {1346#true} ~n := #in~n; {1437#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:38,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {1437#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {1437#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-20 18:13:38,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {1437#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {1519#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:38,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {1519#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} assume true; {1519#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:38,616 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1519#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} {1503#(and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| fibonacci_~n))} #38#return; {1526#(and (<= 1 |fibonacci_#t~ret4|) (<= 1 |fibonacci_#t~ret5|) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-20 18:13:38,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {1526#(and (<= 1 |fibonacci_#t~ret4|) (<= 1 |fibonacci_#t~ret5|) (<= |fibonacci_#in~n| 3))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1530#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-20 18:13:38,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {1530#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} assume true; {1530#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-20 18:13:38,617 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1530#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} {1346#true} #40#return; {1537#(and (<= 2 |ULTIMATE.start_main_#t~ret7#1|) (<= |ULTIMATE.start_main_~x~0#1| 3))} is VALID [2022-02-20 18:13:38,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {1537#(and (<= 2 |ULTIMATE.start_main_#t~ret7#1|) (<= |ULTIMATE.start_main_~x~0#1| 3))} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {1541#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 2 |ULTIMATE.start_main_~result~0#1|))} is VALID [2022-02-20 18:13:38,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {1541#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 2 |ULTIMATE.start_main_~result~0#1|))} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {1347#false} is VALID [2022-02-20 18:13:38,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {1347#false} assume !false; {1347#false} is VALID [2022-02-20 18:13:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 18:13:38,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:40,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {1347#false} assume !false; {1347#false} is VALID [2022-02-20 18:13:40,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {1381#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~result~0#1| 1))} assume !(main_~result~0#1 >= main_~x~0#1 - 1); {1347#false} is VALID [2022-02-20 18:13:40,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {1380#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {1381#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~result~0#1| 1))} is VALID [2022-02-20 18:13:40,046 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1346#true} #40#return; {1380#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_#t~ret7#1| 1))} is VALID [2022-02-20 18:13:40,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:40,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1408#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2022-02-20 18:13:40,048 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1519#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} {1569#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 2)))} #38#return; {1407#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 1))} is VALID [2022-02-20 18:13:40,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {1519#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} assume true; {1519#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:40,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {1579#(or (<= |fibonacci_#in~n| 1) (< 1 fibonacci_~n))} assume 1 == ~n;#res := 1; {1519#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-20 18:13:40,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {1579#(or (<= |fibonacci_#in~n| 1) (< 1 fibonacci_~n))} assume !(~n < 1); {1579#(or (<= |fibonacci_#in~n| 1) (< 1 fibonacci_~n))} is VALID [2022-02-20 18:13:40,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {1346#true} ~n := #in~n; {1579#(or (<= |fibonacci_#in~n| 1) (< 1 fibonacci_~n))} is VALID [2022-02-20 18:13:40,049 INFO L272 TraceCheckUtils]: 27: Hoare triple {1569#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 2)))} call #t~ret5 := fibonacci(~n - 2); {1346#true} is VALID [2022-02-20 18:13:40,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {1569#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 2)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1569#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 2)))} is VALID [2022-02-20 18:13:40,051 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1421#(<= 1 |fibonacci_#res|)} {1592#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} #36#return; {1569#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 2)))} is VALID [2022-02-20 18:13:40,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {1421#(<= 1 |fibonacci_#res|)} assume true; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:40,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {1602#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:40,052 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1420#(<= 0 |fibonacci_#res|)} {1474#(<= 1 |fibonacci_#t~ret4|)} #38#return; {1602#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-20 18:13:40,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {1420#(<= 0 |fibonacci_#res|)} assume true; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:40,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {1346#true} assume ~n < 1;#res := 0; {1420#(<= 0 |fibonacci_#res|)} is VALID [2022-02-20 18:13:40,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:40,053 INFO L272 TraceCheckUtils]: 18: Hoare triple {1474#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {1346#true} is VALID [2022-02-20 18:13:40,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {1474#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1474#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-20 18:13:40,054 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1421#(<= 1 |fibonacci_#res|)} {1346#true} #36#return; {1474#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-20 18:13:40,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {1421#(<= 1 |fibonacci_#res|)} assume true; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:40,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {1346#true} assume 1 == ~n;#res := 1; {1421#(<= 1 |fibonacci_#res|)} is VALID [2022-02-20 18:13:40,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {1346#true} assume !(~n < 1); {1346#true} is VALID [2022-02-20 18:13:40,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:40,054 INFO L272 TraceCheckUtils]: 11: Hoare triple {1346#true} call #t~ret4 := fibonacci(~n - 1); {1346#true} is VALID [2022-02-20 18:13:40,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {1346#true} assume !(1 == ~n); {1346#true} is VALID [2022-02-20 18:13:40,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {1346#true} assume !(~n < 1); {1346#true} is VALID [2022-02-20 18:13:40,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {1346#true} ~n := #in~n; {1346#true} is VALID [2022-02-20 18:13:40,055 INFO L272 TraceCheckUtils]: 7: Hoare triple {1592#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} call #t~ret4 := fibonacci(~n - 1); {1346#true} is VALID [2022-02-20 18:13:40,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {1592#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(1 == ~n); {1592#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-20 18:13:40,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {1592#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(~n < 1); {1592#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-20 18:13:40,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {1346#true} ~n := #in~n; {1592#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-20 18:13:40,056 INFO L272 TraceCheckUtils]: 3: Hoare triple {1346#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1346#true} is VALID [2022-02-20 18:13:40,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {1346#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {1346#true} is VALID [2022-02-20 18:13:40,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {1346#true} 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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1346#true} is VALID [2022-02-20 18:13:40,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {1346#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1346#true} is VALID [2022-02-20 18:13:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 18:13:40,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318722190] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:40,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:40,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 25 [2022-02-20 18:13:40,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291869795] [2022-02-20 18:13:40,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:40,058 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 19 states have internal predecessors, (42), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Word has length 39 [2022-02-20 18:13:40,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:40,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.68) internal successors, (42), 19 states have internal predecessors, (42), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 18:13:40,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:40,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 18:13:40,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:40,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 18:13:40,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:13:40,103 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 19 states have internal predecessors, (42), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 18:13:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:40,782 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2022-02-20 18:13:40,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 18:13:40,782 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 19 states have internal predecessors, (42), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Word has length 39 [2022-02-20 18:13:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 19 states have internal predecessors, (42), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 18:13:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 44 transitions. [2022-02-20 18:13:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 19 states have internal predecessors, (42), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 18:13:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 44 transitions. [2022-02-20 18:13:40,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 44 transitions. [2022-02-20 18:13:40,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:40,841 INFO L225 Difference]: With dead ends: 42 [2022-02-20 18:13:40,841 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 18:13:40,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2022-02-20 18:13:40,842 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:40,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:13:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 18:13:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 18:13:40,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:40,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:40,843 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:40,843 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:40,843 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:13:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:13:40,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:40,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:40,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 18:13:40,844 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 18:13:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:40,844 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:13:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:13:40,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:40,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:40,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:40,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 18:13:40,844 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-02-20 18:13:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:40,845 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 18:13:40,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 19 states have internal predecessors, (42), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 18:13:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:13:40,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:40,847 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:13:40,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 18:13:41,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:41,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 18:13:41,146 INFO L858 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2022-02-20 18:13:41,146 INFO L861 garLoopResultBuilder]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2022-02-20 18:13:41,146 INFO L854 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|)) [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L854 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (not (<= fibonacci_~n 1)) (<= fibonacci_~n (+ |fibonacci_#t~ret4| 1)) .cse0) (and (<= 3 fibonacci_~n) (<= fibonacci_~n (+ |fibonacci_#t~ret4| 2)) .cse0))) [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L861 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L861 garLoopResultBuilder]: At program point L27(lines 27 38) the Hoare annotation is: true [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-02-20 18:13:41,147 INFO L858 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-02-20 18:13:41,149 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-02-20 18:13:41,150 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:13:41,155 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 18:13:41,155 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 18:13:41,155 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 18:13:41,155 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 18:13:41,155 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 18:13:41,155 WARN L170 areAnnotationChecker]: fibonacciFINAL has no Hoare annotation [2022-02-20 18:13:41,155 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 18:13:41,155 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 18:13:41,155 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 18:13:41,156 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 18:13:41,156 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2022-02-20 18:13:41,156 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2022-02-20 18:13:41,156 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2022-02-20 18:13:41,156 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 18:13:41,156 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:13:41,156 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 18:13:41,156 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 18:13:41,156 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 18:13:41,156 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 18:13:41,156 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:13:41,157 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 18:13:41,157 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 18:13:41,157 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 18:13:41,157 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 18:13:41,157 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 18:13:41,157 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 18:13:41,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 06:13:41 BoogieIcfgContainer [2022-02-20 18:13:41,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 18:13:41,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 18:13:41,163 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 18:13:41,163 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 18:13:41,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:30" (3/4) ... [2022-02-20 18:13:41,165 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 18:13:41,174 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2022-02-20 18:13:41,178 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 18:13:41,178 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 18:13:41,178 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 18:13:41,179 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:13:41,201 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 18:13:41,202 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 18:13:41,203 INFO L158 Benchmark]: Toolchain (without parser) took 10737.98ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 61.3MB in the beginning and 93.7MB in the end (delta: -32.3MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2022-02-20 18:13:41,203 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:13:41,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.38ms. Allocated memory is still 94.4MB. Free memory was 61.2MB in the beginning and 70.6MB in the end (delta: -9.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-02-20 18:13:41,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.98ms. Allocated memory is still 94.4MB. Free memory was 70.6MB in the beginning and 69.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:13:41,204 INFO L158 Benchmark]: Boogie Preprocessor took 19.60ms. Allocated memory is still 94.4MB. Free memory was 69.0MB in the beginning and 68.1MB in the end (delta: 890.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:13:41,204 INFO L158 Benchmark]: RCFGBuilder took 227.26ms. Allocated memory is still 94.4MB. Free memory was 68.1MB in the beginning and 58.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 18:13:41,204 INFO L158 Benchmark]: TraceAbstraction took 10185.65ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 57.6MB in the beginning and 95.8MB in the end (delta: -38.2MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2022-02-20 18:13:41,204 INFO L158 Benchmark]: Witness Printer took 39.00ms. Allocated memory is still 172.0MB. Free memory was 95.8MB in the beginning and 93.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:13:41,206 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.38ms. Allocated memory is still 94.4MB. Free memory was 61.2MB in the beginning and 70.6MB in the end (delta: -9.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.98ms. Allocated memory is still 94.4MB. Free memory was 70.6MB in the beginning and 69.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.60ms. Allocated memory is still 94.4MB. Free memory was 69.0MB in the beginning and 68.1MB in the end (delta: 890.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 227.26ms. Allocated memory is still 94.4MB. Free memory was 68.1MB in the beginning and 58.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10185.65ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 57.6MB in the beginning and 95.8MB in the end (delta: -38.2MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * Witness Printer took 39.00ms. Allocated memory is still 172.0MB. Free memory was 95.8MB in the beginning and 93.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 472 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 797 IncrementalHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 85 mSDtfsCounter, 797 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=5, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 32 PreInvPairs, 49 NumberOfFragments, 37 HoareAnnotationTreeSize, 32 FomulaSimplifications, 40 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 92 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 275 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 387 ConstructedInterpolants, 0 QuantifiedInterpolants, 1221 SizeOfPredicates, 16 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 232/366 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 18:13:41,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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