./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-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-simple/fibo_2calls_4-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 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:15:17,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:15:17,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:15:17,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:15:17,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:15:17,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:15:17,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:15:17,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:15:17,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:15:17,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:15:17,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:15:17,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:15:17,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:15:17,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:15:17,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:15:17,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:15:17,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:15:17,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:15:17,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:15:17,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:15:17,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:15:17,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:15:17,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:15:17,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:15:17,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:15:17,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:15:17,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:15:17,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:15:17,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:15:17,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:15:17,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:15:17,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:15:17,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:15:17,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:15:17,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:15:17,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:15:17,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:15:17,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:15:17,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:15:17,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:15:17,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:15:17,407 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:15:17,449 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:15:17,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:15:17,450 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:15:17,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:15:17,451 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:15:17,451 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:15:17,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:15:17,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:15:17,452 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:15:17,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:15:17,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:15:17,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:15:17,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:15:17,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:15:17,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:15:17,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:15:17,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:15:17,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:15:17,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:15:17,454 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:15:17,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:15:17,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:15:17,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:15:17,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:15:17,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:15:17,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:15:17,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:15:17,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:15:17,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:15:17,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:15:17,455 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:15:17,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:15:17,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:15:17,456 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 -> 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 [2022-02-20 18:15:17,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:15:17,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:15:17,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:15:17,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:15:17,854 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:15:17,855 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2022-02-20 18:15:17,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8c028a1/b274d7e1d84c4bef90a90ca7cf7453f2/FLAGc818731ea [2022-02-20 18:15:18,471 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:15:18,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2022-02-20 18:15:18,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8c028a1/b274d7e1d84c4bef90a90ca7cf7453f2/FLAGc818731ea [2022-02-20 18:15:18,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8c028a1/b274d7e1d84c4bef90a90ca7cf7453f2 [2022-02-20 18:15:18,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:15:18,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:15:18,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:15:18,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:15:18,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:15:18,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:15:18" (1/1) ... [2022-02-20 18:15:18,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6dd54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:18, skipping insertion in model container [2022-02-20 18:15:18,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:15:18" (1/1) ... [2022-02-20 18:15:18,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:15:18,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:15:19,150 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-simple/fibo_2calls_4-1.c[946,959] [2022-02-20 18:15:19,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:15:19,170 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:15:19,192 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-simple/fibo_2calls_4-1.c[946,959] [2022-02-20 18:15:19,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:15:19,214 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:15:19,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:19 WrapperNode [2022-02-20 18:15:19,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:15:19,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:15:19,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:15:19,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:15:19,222 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:15:19" (1/1) ... [2022-02-20 18:15:19,255 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:15:19" (1/1) ... [2022-02-20 18:15:19,267 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-02-20 18:15:19,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:15:19,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:15:19,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:15:19,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:15:19,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:19" (1/1) ... [2022-02-20 18:15:19,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:19" (1/1) ... [2022-02-20 18:15:19,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:19" (1/1) ... [2022-02-20 18:15:19,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:19" (1/1) ... [2022-02-20 18:15:19,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:19" (1/1) ... [2022-02-20 18:15:19,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:19" (1/1) ... [2022-02-20 18:15:19,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:19" (1/1) ... [2022-02-20 18:15:19,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:15:19,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:15:19,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:15:19,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:15:19,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:19" (1/1) ... [2022-02-20 18:15:19,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:15:19,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:19,368 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:15:19,416 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:15:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:15:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:15:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-02-20 18:15:19,447 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-02-20 18:15:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-02-20 18:15:19,447 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-02-20 18:15:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:15:19,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:15:19,521 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:15:19,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:15:19,687 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:15:19,692 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:15:19,692 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:15:19,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:15:19 BoogieIcfgContainer [2022-02-20 18:15:19,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:15:19,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:15:19,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:15:19,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:15:19,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:15:18" (1/3) ... [2022-02-20 18:15:19,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710d7d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:15:19, skipping insertion in model container [2022-02-20 18:15:19,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:19" (2/3) ... [2022-02-20 18:15:19,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710d7d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:15:19, skipping insertion in model container [2022-02-20 18:15:19,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:15:19" (3/3) ... [2022-02-20 18:15:19,700 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2022-02-20 18:15:19,703 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:15:19,704 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:15:19,744 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:15:19,749 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:15:19,749 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:15:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:15:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 18:15:19,770 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:19,771 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:19,771 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:19,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:19,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-02-20 18:15:19,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:19,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178260167] [2022-02-20 18:15:19,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:19,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:19,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~n := #in~n; {39#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:19,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:19,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#(<= |fibo1_#in~n| 0)} assume true; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:19,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#(<= |fibo1_#in~n| 0)} {34#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {33#false} is VALID [2022-02-20 18:15:19,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#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(18, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-02-20 18:15:19,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {34#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:19,975 INFO L272 TraceCheckUtils]: 2: Hoare triple {34#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {32#true} is VALID [2022-02-20 18:15:19,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#true} ~n := #in~n; {39#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:19,976 INFO L290 TraceCheckUtils]: 4: Hoare triple {39#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:19,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#(<= |fibo1_#in~n| 0)} assume true; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:19,977 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {40#(<= |fibo1_#in~n| 0)} {34#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {33#false} is VALID [2022-02-20 18:15:19,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {33#false} is VALID [2022-02-20 18:15:19,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} assume 3 != main_~result~0#1; {33#false} is VALID [2022-02-20 18:15:19,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 18:15:19,979 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:15:19,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:19,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178260167] [2022-02-20 18:15:19,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178260167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:15:19,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:15:19,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:15:19,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132719541] [2022-02-20 18:15:19,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:15:19,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2022-02-20 18:15:19,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:19,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:15:20,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:20,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:15:20,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:20,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:15:20,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:15:20,042 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:15:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:20,208 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-20 18:15:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:15:20,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2022-02-20 18:15:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:15:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-02-20 18:15:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:15:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-02-20 18:15:20,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-02-20 18:15:20,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:20,262 INFO L225 Difference]: With dead ends: 39 [2022-02-20 18:15:20,263 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 18:15:20,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:15:20,267 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:20,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:15:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 18:15:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 18:15:20,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:20,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:20,291 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:20,291 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:20,295 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 18:15:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:20,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:20,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:20,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 27 states. [2022-02-20 18:15:20,297 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 27 states. [2022-02-20 18:15:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:20,300 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 18:15:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:20,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:20,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:20,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:20,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-02-20 18:15:20,304 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-02-20 18:15:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:20,305 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-02-20 18:15:20,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:15:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 18:15:20,306 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:20,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:20,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:15:20,306 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:20,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:20,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-02-20 18:15:20,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:20,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117238154] [2022-02-20 18:15:20,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:20,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:20,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:20,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {181#true} ~n := #in~n; {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:20,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:20,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:20,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {190#(<= |fibo1_#in~n| 1)} assume true; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:20,356 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {190#(<= |fibo1_#in~n| 1)} {183#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {182#false} is VALID [2022-02-20 18:15:20,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {181#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(18, 2);call #Ultimate.allocInit(12, 3); {181#true} is VALID [2022-02-20 18:15:20,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {183#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:20,357 INFO L272 TraceCheckUtils]: 2: Hoare triple {183#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {181#true} is VALID [2022-02-20 18:15:20,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {181#true} ~n := #in~n; {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:20,358 INFO L290 TraceCheckUtils]: 4: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:20,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:20,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#(<= |fibo1_#in~n| 1)} assume true; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:20,359 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {190#(<= |fibo1_#in~n| 1)} {183#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {182#false} is VALID [2022-02-20 18:15:20,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {182#false} is VALID [2022-02-20 18:15:20,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#false} assume 3 != main_~result~0#1; {182#false} is VALID [2022-02-20 18:15:20,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-02-20 18:15:20,360 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:15:20,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:20,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117238154] [2022-02-20 18:15:20,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117238154] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:15:20,361 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:15:20,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:15:20,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188392855] [2022-02-20 18:15:20,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:15:20,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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:15:20,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:20,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) 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:15:20,371 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:15:20,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:15:20,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:20,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:15:20,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:15:20,373 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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:15:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:20,471 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 18:15:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:15:20,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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:15:20,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) 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:15:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 18:15:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) 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:15:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 18:15:20,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-02-20 18:15:20,504 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:15:20,505 INFO L225 Difference]: With dead ends: 33 [2022-02-20 18:15:20,506 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 18:15:20,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:15:20,507 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:20,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:15:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 18:15:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-20 18:15:20,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:20,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:20,512 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:20,513 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:20,514 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 18:15:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-20 18:15:20,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:20,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:20,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 29 states. [2022-02-20 18:15:20,516 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 29 states. [2022-02-20 18:15:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:20,518 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 18:15:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-20 18:15:20,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:20,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:20,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:20,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-02-20 18:15:20,520 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-02-20 18:15:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:20,521 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-02-20 18:15:20,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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:15:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 18:15:20,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:20,522 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:20,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:15:20,523 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:20,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-02-20 18:15:20,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:20,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104014908] [2022-02-20 18:15:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:20,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:20,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~n := #in~n; {356#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:20,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {356#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {357#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:20,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#(<= |fibo2_#in~n| 0)} assume true; {357#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:20,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#(<= |fibo2_#in~n| 0)} {347#(not (<= fibo1_~n 1))} #53#return; {328#false} is VALID [2022-02-20 18:15:20,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 18:15:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:20,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:20,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:20,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:20,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {328#false} #55#return; {328#false} is VALID [2022-02-20 18:15:20,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:20,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(~n < 1); {346#(< 0 fibo1_~n)} is VALID [2022-02-20 18:15:20,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {346#(< 0 fibo1_~n)} assume !(1 == ~n); {347#(not (<= fibo1_~n 1))} is VALID [2022-02-20 18:15:20,616 INFO L272 TraceCheckUtils]: 3: Hoare triple {347#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:20,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#true} ~n := #in~n; {356#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:20,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {356#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {357#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:20,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {357#(<= |fibo2_#in~n| 0)} assume true; {357#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:20,618 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {357#(<= |fibo2_#in~n| 0)} {347#(not (<= fibo1_~n 1))} #53#return; {328#false} is VALID [2022-02-20 18:15:20,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {328#false} is VALID [2022-02-20 18:15:20,619 INFO L272 TraceCheckUtils]: 9: Hoare triple {328#false} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:20,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:20,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:20,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:20,620 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {327#true} {328#false} #55#return; {328#false} is VALID [2022-02-20 18:15:20,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {328#false} is VALID [2022-02-20 18:15:20,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#false} assume true; {328#false} is VALID [2022-02-20 18:15:20,621 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {328#false} {327#true} #47#return; {328#false} is VALID [2022-02-20 18:15:20,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#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(18, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-02-20 18:15:20,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {327#true} is VALID [2022-02-20 18:15:20,621 INFO L272 TraceCheckUtils]: 2: Hoare triple {327#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {327#true} is VALID [2022-02-20 18:15:20,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:20,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#true} assume !(~n < 1); {346#(< 0 fibo1_~n)} is VALID [2022-02-20 18:15:20,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {346#(< 0 fibo1_~n)} assume !(1 == ~n); {347#(not (<= fibo1_~n 1))} is VALID [2022-02-20 18:15:20,623 INFO L272 TraceCheckUtils]: 6: Hoare triple {347#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:20,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~n := #in~n; {356#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:20,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {357#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:20,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(<= |fibo2_#in~n| 0)} assume true; {357#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:20,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {357#(<= |fibo2_#in~n| 0)} {347#(not (<= fibo1_~n 1))} #53#return; {328#false} is VALID [2022-02-20 18:15:20,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {328#false} is VALID [2022-02-20 18:15:20,626 INFO L272 TraceCheckUtils]: 12: Hoare triple {328#false} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:20,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:20,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:20,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:20,627 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {327#true} {328#false} #55#return; {328#false} is VALID [2022-02-20 18:15:20,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {328#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {328#false} is VALID [2022-02-20 18:15:20,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {328#false} assume true; {328#false} is VALID [2022-02-20 18:15:20,627 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {328#false} {327#true} #47#return; {328#false} is VALID [2022-02-20 18:15:20,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {328#false} is VALID [2022-02-20 18:15:20,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume 3 != main_~result~0#1; {328#false} is VALID [2022-02-20 18:15:20,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 18:15:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:20,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:20,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104014908] [2022-02-20 18:15:20,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104014908] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:20,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397563404] [2022-02-20 18:15:20,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:20,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:20,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:20,631 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:15:20,632 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:15:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:20,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:15:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:20,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:20,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#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(18, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-02-20 18:15:20,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {364#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:20,836 INFO L272 TraceCheckUtils]: 2: Hoare triple {364#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {327#true} is VALID [2022-02-20 18:15:20,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} ~n := #in~n; {371#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:20,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {371#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {371#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:20,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {371#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:20,837 INFO L272 TraceCheckUtils]: 6: Hoare triple {371#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:20,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~n := #in~n; {384#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:20,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {384#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {357#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:20,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(<= |fibo2_#in~n| 0)} assume true; {357#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:20,840 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {357#(<= |fibo2_#in~n| 0)} {371#(<= |fibo1_#in~n| fibo1_~n)} #53#return; {394#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:20,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {394#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:20,840 INFO L272 TraceCheckUtils]: 12: Hoare triple {394#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:20,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:20,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:20,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:20,841 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {327#true} {394#(<= |fibo1_#in~n| 1)} #55#return; {394#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:20,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {394#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {394#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:20,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {394#(<= |fibo1_#in~n| 1)} assume true; {394#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:20,843 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {394#(<= |fibo1_#in~n| 1)} {364#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {328#false} is VALID [2022-02-20 18:15:20,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {328#false} is VALID [2022-02-20 18:15:20,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume 3 != main_~result~0#1; {328#false} is VALID [2022-02-20 18:15:20,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 18:15:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:20,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:21,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 18:15:21,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume 3 != main_~result~0#1; {328#false} is VALID [2022-02-20 18:15:21,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {328#false} is VALID [2022-02-20 18:15:21,262 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {394#(<= |fibo1_#in~n| 1)} {440#(<= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {328#false} is VALID [2022-02-20 18:15:21,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {394#(<= |fibo1_#in~n| 1)} assume true; {394#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:21,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {394#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {394#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:21,264 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {327#true} {394#(<= |fibo1_#in~n| 1)} #55#return; {394#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:21,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:21,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:21,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:21,265 INFO L272 TraceCheckUtils]: 12: Hoare triple {394#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:21,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {394#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:21,266 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {357#(<= |fibo2_#in~n| 0)} {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} #53#return; {394#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:21,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(<= |fibo2_#in~n| 0)} assume true; {357#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:21,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} assume ~n < 1;#res := 0; {357#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:21,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~n := #in~n; {481#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} is VALID [2022-02-20 18:15:21,267 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:21,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(1 == ~n); {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-20 18:15:21,268 INFO L290 TraceCheckUtils]: 4: Hoare triple {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(~n < 1); {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-20 18:15:21,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} ~n := #in~n; {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-20 18:15:21,269 INFO L272 TraceCheckUtils]: 2: Hoare triple {440#(<= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {327#true} is VALID [2022-02-20 18:15:21,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {440#(<= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:21,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#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(18, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-02-20 18:15:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:21,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397563404] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:21,270 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:21,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-02-20 18:15:21,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775290867] [2022-02-20 18:15:21,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:21,271 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-02-20 18:15:21,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:21,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:15:21,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:21,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:15:21,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:21,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:15:21,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:15:21,302 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:15:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:21,629 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-02-20 18:15:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:15:21,629 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-02-20 18:15:21,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:15:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-02-20 18:15:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:15:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-02-20 18:15:21,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2022-02-20 18:15:21,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:21,693 INFO L225 Difference]: With dead ends: 55 [2022-02-20 18:15:21,693 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 18:15:21,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:15:21,695 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:21,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 111 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:15:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 18:15:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-02-20 18:15:21,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:21,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:21,711 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:21,712 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:21,713 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 18:15:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 18:15:21,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:21,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:21,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Second operand 31 states. [2022-02-20 18:15:21,714 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Second operand 31 states. [2022-02-20 18:15:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:21,716 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 18:15:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 18:15:21,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:21,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:21,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:21,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-02-20 18:15:21,719 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-02-20 18:15:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:21,719 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-02-20 18:15:21,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:15:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 18:15:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 18:15:21,720 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:21,731 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:21,750 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:15:21,932 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:15:21,932 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:21,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-02-20 18:15:21,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:21,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617433061] [2022-02-20 18:15:21,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:21,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:21,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:21,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:22,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} ~n := #in~n; {708#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:22,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {708#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {708#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:22,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {708#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {709#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:22,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {709#(<= |fibo2_#in~n| 1)} assume true; {709#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:22,018 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {709#(<= |fibo2_#in~n| 1)} {696#(= fibo1_~n |fibo1_#in~n|)} #53#return; {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:22,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:22,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:22,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume ~n < 1;#res := 0; {675#true} is VALID [2022-02-20 18:15:22,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} assume true; {675#true} is VALID [2022-02-20 18:15:22,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #55#return; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} ~n := #in~n; {696#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:22,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {696#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {696#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:22,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {696#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {696#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:22,026 INFO L272 TraceCheckUtils]: 3: Hoare triple {696#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {675#true} is VALID [2022-02-20 18:15:22,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {675#true} ~n := #in~n; {708#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:22,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {708#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {708#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:22,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {708#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {709#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:22,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {709#(<= |fibo2_#in~n| 1)} assume true; {709#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:22,028 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {709#(<= |fibo2_#in~n| 1)} {696#(= fibo1_~n |fibo1_#in~n|)} #53#return; {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:22,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:22,028 INFO L272 TraceCheckUtils]: 10: Hoare triple {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {675#true} is VALID [2022-02-20 18:15:22,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:22,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {675#true} assume ~n < 1;#res := 0; {675#true} is VALID [2022-02-20 18:15:22,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {675#true} assume true; {675#true} is VALID [2022-02-20 18:15:22,029 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {675#true} {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #55#return; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {707#(<= |fibo1_#in~n| 2)} assume true; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,030 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {707#(<= |fibo1_#in~n| 2)} {677#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {676#false} is VALID [2022-02-20 18:15:22,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#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(18, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-02-20 18:15:22,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {677#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:22,031 INFO L272 TraceCheckUtils]: 2: Hoare triple {677#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {675#true} is VALID [2022-02-20 18:15:22,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {675#true} ~n := #in~n; {696#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:22,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {696#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {696#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:22,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {696#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {696#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:22,032 INFO L272 TraceCheckUtils]: 6: Hoare triple {696#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {675#true} is VALID [2022-02-20 18:15:22,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#true} ~n := #in~n; {708#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:22,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {708#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {708#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:22,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {708#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {709#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:22,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(<= |fibo2_#in~n| 1)} assume true; {709#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:22,034 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {709#(<= |fibo2_#in~n| 1)} {696#(= fibo1_~n |fibo1_#in~n|)} #53#return; {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:22,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:22,034 INFO L272 TraceCheckUtils]: 13: Hoare triple {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {675#true} is VALID [2022-02-20 18:15:22,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:22,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#true} assume ~n < 1;#res := 0; {675#true} is VALID [2022-02-20 18:15:22,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {675#true} assume true; {675#true} is VALID [2022-02-20 18:15:22,035 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {675#true} {702#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #55#return; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {707#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {707#(<= |fibo1_#in~n| 2)} assume true; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,036 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {707#(<= |fibo1_#in~n| 2)} {677#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {676#false} is VALID [2022-02-20 18:15:22,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {676#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {676#false} is VALID [2022-02-20 18:15:22,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {676#false} assume 3 != main_~result~0#1; {676#false} is VALID [2022-02-20 18:15:22,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {676#false} assume !false; {676#false} is VALID [2022-02-20 18:15:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:22,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:22,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617433061] [2022-02-20 18:15:22,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617433061] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:22,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357013803] [2022-02-20 18:15:22,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:22,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:22,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:22,039 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:15:22,040 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:15:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:22,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:15:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:22,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:22,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#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(18, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-02-20 18:15:22,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {677#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:22,210 INFO L272 TraceCheckUtils]: 2: Hoare triple {677#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {675#true} is VALID [2022-02-20 18:15:22,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {675#true} ~n := #in~n; {722#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:22,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {722#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {722#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:22,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {722#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {722#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:22,211 INFO L272 TraceCheckUtils]: 6: Hoare triple {722#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {675#true} is VALID [2022-02-20 18:15:22,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#true} ~n := #in~n; {735#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:22,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {735#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {735#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:22,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {709#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:22,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(<= |fibo2_#in~n| 1)} assume true; {709#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:22,215 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {709#(<= |fibo2_#in~n| 1)} {722#(<= |fibo1_#in~n| fibo1_~n)} #53#return; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {707#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,216 INFO L272 TraceCheckUtils]: 13: Hoare triple {707#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {675#true} is VALID [2022-02-20 18:15:22,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:22,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#true} assume ~n < 1;#res := 0; {675#true} is VALID [2022-02-20 18:15:22,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {675#true} assume true; {675#true} is VALID [2022-02-20 18:15:22,219 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {675#true} {707#(<= |fibo1_#in~n| 2)} #55#return; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {707#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {707#(<= |fibo1_#in~n| 2)} assume true; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,221 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {707#(<= |fibo1_#in~n| 2)} {677#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {676#false} is VALID [2022-02-20 18:15:22,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {676#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {676#false} is VALID [2022-02-20 18:15:22,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {676#false} assume 3 != main_~result~0#1; {676#false} is VALID [2022-02-20 18:15:22,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {676#false} assume !false; {676#false} is VALID [2022-02-20 18:15:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:22,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:22,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {676#false} assume !false; {676#false} is VALID [2022-02-20 18:15:22,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {676#false} assume 3 != main_~result~0#1; {676#false} is VALID [2022-02-20 18:15:22,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {676#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {676#false} is VALID [2022-02-20 18:15:22,639 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {707#(<= |fibo1_#in~n| 2)} {793#(< 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {676#false} is VALID [2022-02-20 18:15:22,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {707#(<= |fibo1_#in~n| 2)} assume true; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {707#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,640 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {675#true} {707#(<= |fibo1_#in~n| 2)} #55#return; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {675#true} assume true; {675#true} is VALID [2022-02-20 18:15:22,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#true} assume ~n < 1;#res := 0; {675#true} is VALID [2022-02-20 18:15:22,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:22,640 INFO L272 TraceCheckUtils]: 13: Hoare triple {707#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {675#true} is VALID [2022-02-20 18:15:22,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {707#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,647 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {709#(<= |fibo2_#in~n| 1)} {824#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} #53#return; {707#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:22,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(<= |fibo2_#in~n| 1)} assume true; {709#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:22,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume 1 == ~n;#res := 1; {709#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:22,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {834#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume !(~n < 1); {834#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-20 18:15:22,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#true} ~n := #in~n; {834#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-20 18:15:22,649 INFO L272 TraceCheckUtils]: 6: Hoare triple {824#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} call #t~ret4 := fibo2(~n - 1); {675#true} is VALID [2022-02-20 18:15:22,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {824#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(1 == ~n); {824#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-20 18:15:22,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {824#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(~n < 1); {824#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-20 18:15:22,656 INFO L290 TraceCheckUtils]: 3: Hoare triple {675#true} ~n := #in~n; {824#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-20 18:15:22,656 INFO L272 TraceCheckUtils]: 2: Hoare triple {793#(< 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {675#true} is VALID [2022-02-20 18:15:22,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {793#(< 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:22,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#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(18, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-02-20 18:15:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:22,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357013803] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:22,657 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:22,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-02-20 18:15:22,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860463809] [2022-02-20 18:15:22,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:22,658 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-02-20 18:15:22,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:22,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:22,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:22,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:15:22,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:22,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:15:22,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:15:22,684 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:23,081 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-02-20 18:15:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:15:23,081 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-02-20 18:15:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-02-20 18:15:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-02-20 18:15:23,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 63 transitions. [2022-02-20 18:15:23,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:23,129 INFO L225 Difference]: With dead ends: 51 [2022-02-20 18:15:23,129 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 18:15:23,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:15:23,130 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 57 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:23,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 109 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:15:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 18:15:23,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-02-20 18:15:23,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:23,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-02-20 18:15:23,152 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-02-20 18:15:23,153 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-02-20 18:15:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:23,162 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2022-02-20 18:15:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2022-02-20 18:15:23,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:23,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:23,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Second operand 47 states. [2022-02-20 18:15:23,164 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Second operand 47 states. [2022-02-20 18:15:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:23,172 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2022-02-20 18:15:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2022-02-20 18:15:23,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:23,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:23,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:23,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-02-20 18:15:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-02-20 18:15:23,176 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2022-02-20 18:15:23,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:23,176 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-02-20 18:15:23,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-02-20 18:15:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 18:15:23,177 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:23,178 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:23,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 18:15:23,403 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:15:23,403 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:23,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2022-02-20 18:15:23,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:23,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823623229] [2022-02-20 18:15:23,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:23,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:23,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:23,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:23,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#true} ~n := #in~n; {1137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:23,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:23,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {1138#(<= |fibo1_#in~n| 0)} assume true; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:23,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1138#(<= |fibo1_#in~n| 0)} {1128#(not (<= fibo2_~n 1))} #49#return; {1075#false} is VALID [2022-02-20 18:15:23,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 18:15:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:23,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume ~n < 1;#res := 0; {1074#true} is VALID [2022-02-20 18:15:23,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-02-20 18:15:23,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1075#false} #51#return; {1075#false} is VALID [2022-02-20 18:15:23,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume !(~n < 1); {1127#(< 0 fibo2_~n)} is VALID [2022-02-20 18:15:23,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {1127#(< 0 fibo2_~n)} assume !(1 == ~n); {1128#(not (<= fibo2_~n 1))} is VALID [2022-02-20 18:15:23,497 INFO L272 TraceCheckUtils]: 3: Hoare triple {1128#(not (<= fibo2_~n 1))} call #t~ret6 := fibo1(~n - 1); {1074#true} is VALID [2022-02-20 18:15:23,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {1074#true} ~n := #in~n; {1137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:23,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {1137#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:23,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#(<= |fibo1_#in~n| 0)} assume true; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:23,499 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1138#(<= |fibo1_#in~n| 0)} {1128#(not (<= fibo2_~n 1))} #49#return; {1075#false} is VALID [2022-02-20 18:15:23,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {1075#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1075#false} is VALID [2022-02-20 18:15:23,499 INFO L272 TraceCheckUtils]: 9: Hoare triple {1075#false} call #t~ret7 := fibo1(~n - 2); {1074#true} is VALID [2022-02-20 18:15:23,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {1074#true} assume ~n < 1;#res := 0; {1074#true} is VALID [2022-02-20 18:15:23,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-02-20 18:15:23,499 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1074#true} {1075#false} #51#return; {1075#false} is VALID [2022-02-20 18:15:23,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {1075#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1075#false} is VALID [2022-02-20 18:15:23,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#false} assume true; {1075#false} is VALID [2022-02-20 18:15:23,500 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1075#false} {1074#true} #53#return; {1075#false} is VALID [2022-02-20 18:15:23,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 18:15:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:23,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume ~n < 1;#res := 0; {1074#true} is VALID [2022-02-20 18:15:23,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-02-20 18:15:23,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1075#false} #55#return; {1075#false} is VALID [2022-02-20 18:15:23,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume !(~n < 1); {1074#true} is VALID [2022-02-20 18:15:23,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#true} assume !(1 == ~n); {1074#true} is VALID [2022-02-20 18:15:23,504 INFO L272 TraceCheckUtils]: 3: Hoare triple {1074#true} call #t~ret4 := fibo2(~n - 1); {1074#true} is VALID [2022-02-20 18:15:23,504 INFO L290 TraceCheckUtils]: 4: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#true} assume !(~n < 1); {1127#(< 0 fibo2_~n)} is VALID [2022-02-20 18:15:23,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {1127#(< 0 fibo2_~n)} assume !(1 == ~n); {1128#(not (<= fibo2_~n 1))} is VALID [2022-02-20 18:15:23,505 INFO L272 TraceCheckUtils]: 7: Hoare triple {1128#(not (<= fibo2_~n 1))} call #t~ret6 := fibo1(~n - 1); {1074#true} is VALID [2022-02-20 18:15:23,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#true} ~n := #in~n; {1137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:23,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:23,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {1138#(<= |fibo1_#in~n| 0)} assume true; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:23,506 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1138#(<= |fibo1_#in~n| 0)} {1128#(not (<= fibo2_~n 1))} #49#return; {1075#false} is VALID [2022-02-20 18:15:23,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {1075#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1075#false} is VALID [2022-02-20 18:15:23,506 INFO L272 TraceCheckUtils]: 13: Hoare triple {1075#false} call #t~ret7 := fibo1(~n - 2); {1074#true} is VALID [2022-02-20 18:15:23,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {1074#true} assume ~n < 1;#res := 0; {1074#true} is VALID [2022-02-20 18:15:23,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-02-20 18:15:23,507 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1074#true} {1075#false} #51#return; {1075#false} is VALID [2022-02-20 18:15:23,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {1075#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1075#false} is VALID [2022-02-20 18:15:23,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {1075#false} assume true; {1075#false} is VALID [2022-02-20 18:15:23,507 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1075#false} {1074#true} #53#return; {1075#false} is VALID [2022-02-20 18:15:23,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {1075#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1075#false} is VALID [2022-02-20 18:15:23,507 INFO L272 TraceCheckUtils]: 22: Hoare triple {1075#false} call #t~ret5 := fibo2(~n - 2); {1074#true} is VALID [2022-02-20 18:15:23,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {1074#true} assume ~n < 1;#res := 0; {1074#true} is VALID [2022-02-20 18:15:23,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-02-20 18:15:23,507 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1074#true} {1075#false} #55#return; {1075#false} is VALID [2022-02-20 18:15:23,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {1075#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1075#false} is VALID [2022-02-20 18:15:23,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {1075#false} assume true; {1075#false} is VALID [2022-02-20 18:15:23,507 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1075#false} {1074#true} #47#return; {1075#false} is VALID [2022-02-20 18:15:23,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#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(18, 2);call #Ultimate.allocInit(12, 3); {1074#true} is VALID [2022-02-20 18:15:23,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {1074#true} is VALID [2022-02-20 18:15:23,508 INFO L272 TraceCheckUtils]: 2: Hoare triple {1074#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1074#true} is VALID [2022-02-20 18:15:23,508 INFO L290 TraceCheckUtils]: 3: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,508 INFO L290 TraceCheckUtils]: 4: Hoare triple {1074#true} assume !(~n < 1); {1074#true} is VALID [2022-02-20 18:15:23,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#true} assume !(1 == ~n); {1074#true} is VALID [2022-02-20 18:15:23,508 INFO L272 TraceCheckUtils]: 6: Hoare triple {1074#true} call #t~ret4 := fibo2(~n - 1); {1074#true} is VALID [2022-02-20 18:15:23,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#true} assume !(~n < 1); {1127#(< 0 fibo2_~n)} is VALID [2022-02-20 18:15:23,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {1127#(< 0 fibo2_~n)} assume !(1 == ~n); {1128#(not (<= fibo2_~n 1))} is VALID [2022-02-20 18:15:23,509 INFO L272 TraceCheckUtils]: 10: Hoare triple {1128#(not (<= fibo2_~n 1))} call #t~ret6 := fibo1(~n - 1); {1074#true} is VALID [2022-02-20 18:15:23,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {1074#true} ~n := #in~n; {1137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:23,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {1137#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:23,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {1138#(<= |fibo1_#in~n| 0)} assume true; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:23,510 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1138#(<= |fibo1_#in~n| 0)} {1128#(not (<= fibo2_~n 1))} #49#return; {1075#false} is VALID [2022-02-20 18:15:23,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1075#false} is VALID [2022-02-20 18:15:23,511 INFO L272 TraceCheckUtils]: 16: Hoare triple {1075#false} call #t~ret7 := fibo1(~n - 2); {1074#true} is VALID [2022-02-20 18:15:23,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {1074#true} assume ~n < 1;#res := 0; {1074#true} is VALID [2022-02-20 18:15:23,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-02-20 18:15:23,511 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1074#true} {1075#false} #51#return; {1075#false} is VALID [2022-02-20 18:15:23,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {1075#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1075#false} is VALID [2022-02-20 18:15:23,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {1075#false} assume true; {1075#false} is VALID [2022-02-20 18:15:23,511 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1075#false} {1074#true} #53#return; {1075#false} is VALID [2022-02-20 18:15:23,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {1075#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1075#false} is VALID [2022-02-20 18:15:23,511 INFO L272 TraceCheckUtils]: 25: Hoare triple {1075#false} call #t~ret5 := fibo2(~n - 2); {1074#true} is VALID [2022-02-20 18:15:23,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {1074#true} assume ~n < 1;#res := 0; {1074#true} is VALID [2022-02-20 18:15:23,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-02-20 18:15:23,511 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1074#true} {1075#false} #55#return; {1075#false} is VALID [2022-02-20 18:15:23,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {1075#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1075#false} is VALID [2022-02-20 18:15:23,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {1075#false} assume true; {1075#false} is VALID [2022-02-20 18:15:23,512 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1075#false} {1074#true} #47#return; {1075#false} is VALID [2022-02-20 18:15:23,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {1075#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1075#false} is VALID [2022-02-20 18:15:23,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {1075#false} assume 3 != main_~result~0#1; {1075#false} is VALID [2022-02-20 18:15:23,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-02-20 18:15:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:15:23,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:23,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823623229] [2022-02-20 18:15:23,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823623229] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:23,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023269] [2022-02-20 18:15:23,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:23,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:23,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:23,514 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:15:23,515 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:15:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:23,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:15:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:23,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:23,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#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(18, 2);call #Ultimate.allocInit(12, 3); {1074#true} is VALID [2022-02-20 18:15:23,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {1145#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:23,745 INFO L272 TraceCheckUtils]: 2: Hoare triple {1145#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1074#true} is VALID [2022-02-20 18:15:23,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {1074#true} ~n := #in~n; {1152#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:23,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {1152#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1152#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:23,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {1152#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {1152#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:23,746 INFO L272 TraceCheckUtils]: 6: Hoare triple {1152#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {1074#true} is VALID [2022-02-20 18:15:23,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#true} ~n := #in~n; {1165#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:23,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {1165#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {1165#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:23,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {1165#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {1165#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:23,747 INFO L272 TraceCheckUtils]: 10: Hoare triple {1165#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {1074#true} is VALID [2022-02-20 18:15:23,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {1074#true} ~n := #in~n; {1152#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:23,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {1152#(<= |fibo1_#in~n| fibo1_~n)} assume ~n < 1;#res := 0; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:23,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {1138#(<= |fibo1_#in~n| 0)} assume true; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:23,748 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1138#(<= |fibo1_#in~n| 0)} {1165#(<= |fibo2_#in~n| fibo2_~n)} #49#return; {1187#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:23,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {1187#(<= |fibo2_#in~n| 1)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1187#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:23,749 INFO L272 TraceCheckUtils]: 16: Hoare triple {1187#(<= |fibo2_#in~n| 1)} call #t~ret7 := fibo1(~n - 2); {1074#true} is VALID [2022-02-20 18:15:23,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {1074#true} assume ~n < 1;#res := 0; {1074#true} is VALID [2022-02-20 18:15:23,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-02-20 18:15:23,750 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1074#true} {1187#(<= |fibo2_#in~n| 1)} #51#return; {1187#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:23,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {1187#(<= |fibo2_#in~n| 1)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1187#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:23,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {1187#(<= |fibo2_#in~n| 1)} assume true; {1187#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:23,751 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1187#(<= |fibo2_#in~n| 1)} {1152#(<= |fibo1_#in~n| fibo1_~n)} #53#return; {1215#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:23,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {1215#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1215#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:23,751 INFO L272 TraceCheckUtils]: 25: Hoare triple {1215#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {1074#true} is VALID [2022-02-20 18:15:23,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:23,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {1074#true} assume ~n < 1;#res := 0; {1074#true} is VALID [2022-02-20 18:15:23,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-02-20 18:15:23,753 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1074#true} {1215#(<= |fibo1_#in~n| 2)} #55#return; {1215#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:23,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {1215#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1215#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:23,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {1215#(<= |fibo1_#in~n| 2)} assume true; {1215#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:23,754 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1215#(<= |fibo1_#in~n| 2)} {1145#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {1075#false} is VALID [2022-02-20 18:15:23,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {1075#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1075#false} is VALID [2022-02-20 18:15:23,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {1075#false} assume 3 != main_~result~0#1; {1075#false} is VALID [2022-02-20 18:15:23,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-02-20 18:15:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 18:15:23,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:24,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-02-20 18:15:24,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {1075#false} assume 3 != main_~result~0#1; {1075#false} is VALID [2022-02-20 18:15:24,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {1075#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1075#false} is VALID [2022-02-20 18:15:24,565 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1215#(<= |fibo1_#in~n| 2)} {1261#(<= 3 |ULTIMATE.start_main_~x~0#1|)} #47#return; {1075#false} is VALID [2022-02-20 18:15:24,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {1215#(<= |fibo1_#in~n| 2)} assume true; {1215#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:24,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {1215#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1215#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:24,566 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1074#true} {1215#(<= |fibo1_#in~n| 2)} #55#return; {1215#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:24,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-02-20 18:15:24,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {1074#true} assume ~n < 1;#res := 0; {1074#true} is VALID [2022-02-20 18:15:24,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:24,567 INFO L272 TraceCheckUtils]: 25: Hoare triple {1215#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {1074#true} is VALID [2022-02-20 18:15:24,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {1215#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1215#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:24,568 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1187#(<= |fibo2_#in~n| 1)} {1292#(or (<= 3 fibo1_~n) (<= |fibo1_#in~n| 2))} #53#return; {1215#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:24,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {1187#(<= |fibo2_#in~n| 1)} assume true; {1187#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:24,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {1187#(<= |fibo2_#in~n| 1)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1187#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:24,569 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1074#true} {1187#(<= |fibo2_#in~n| 1)} #51#return; {1187#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:24,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-02-20 18:15:24,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {1074#true} assume ~n < 1;#res := 0; {1074#true} is VALID [2022-02-20 18:15:24,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {1074#true} ~n := #in~n; {1074#true} is VALID [2022-02-20 18:15:24,579 INFO L272 TraceCheckUtils]: 16: Hoare triple {1187#(<= |fibo2_#in~n| 1)} call #t~ret7 := fibo1(~n - 2); {1074#true} is VALID [2022-02-20 18:15:24,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {1187#(<= |fibo2_#in~n| 1)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1187#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:24,581 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1138#(<= |fibo1_#in~n| 0)} {1323#(or (<= 2 fibo2_~n) (<= |fibo2_#in~n| 1))} #49#return; {1187#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:24,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {1138#(<= |fibo1_#in~n| 0)} assume true; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:24,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {1333#(or (<= |fibo1_#in~n| 0) (not (< fibo1_~n 1)))} assume ~n < 1;#res := 0; {1138#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:24,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {1074#true} ~n := #in~n; {1333#(or (<= |fibo1_#in~n| 0) (not (< fibo1_~n 1)))} is VALID [2022-02-20 18:15:24,587 INFO L272 TraceCheckUtils]: 10: Hoare triple {1323#(or (<= 2 fibo2_~n) (<= |fibo2_#in~n| 1))} call #t~ret6 := fibo1(~n - 1); {1074#true} is VALID [2022-02-20 18:15:24,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {1323#(or (<= 2 fibo2_~n) (<= |fibo2_#in~n| 1))} assume !(1 == ~n); {1323#(or (<= 2 fibo2_~n) (<= |fibo2_#in~n| 1))} is VALID [2022-02-20 18:15:24,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {1323#(or (<= 2 fibo2_~n) (<= |fibo2_#in~n| 1))} assume !(~n < 1); {1323#(or (<= 2 fibo2_~n) (<= |fibo2_#in~n| 1))} is VALID [2022-02-20 18:15:24,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#true} ~n := #in~n; {1323#(or (<= 2 fibo2_~n) (<= |fibo2_#in~n| 1))} is VALID [2022-02-20 18:15:24,588 INFO L272 TraceCheckUtils]: 6: Hoare triple {1292#(or (<= 3 fibo1_~n) (<= |fibo1_#in~n| 2))} call #t~ret4 := fibo2(~n - 1); {1074#true} is VALID [2022-02-20 18:15:24,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {1292#(or (<= 3 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(1 == ~n); {1292#(or (<= 3 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-20 18:15:24,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {1292#(or (<= 3 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(~n < 1); {1292#(or (<= 3 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-20 18:15:24,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {1074#true} ~n := #in~n; {1292#(or (<= 3 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-20 18:15:24,589 INFO L272 TraceCheckUtils]: 2: Hoare triple {1261#(<= 3 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1074#true} is VALID [2022-02-20 18:15:24,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {1261#(<= 3 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:24,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#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(18, 2);call #Ultimate.allocInit(12, 3); {1074#true} is VALID [2022-02-20 18:15:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 18:15:24,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023269] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:24,590 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:24,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2022-02-20 18:15:24,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422471415] [2022-02-20 18:15:24,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:24,591 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2022-02-20 18:15:24,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:24,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-02-20 18:15:24,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:24,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 18:15:24,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:24,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 18:15:24,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:15:24,634 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-02-20 18:15:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:25,213 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2022-02-20 18:15:25,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:15:25,214 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2022-02-20 18:15:25,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-02-20 18:15:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-02-20 18:15:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-02-20 18:15:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-02-20 18:15:25,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 99 transitions. [2022-02-20 18:15:25,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:25,307 INFO L225 Difference]: With dead ends: 105 [2022-02-20 18:15:25,307 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 18:15:25,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:15:25,309 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:25,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 146 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:15:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 18:15:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-02-20 18:15:25,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:25,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-02-20 18:15:25,357 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-02-20 18:15:25,357 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-02-20 18:15:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:25,360 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2022-02-20 18:15:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-02-20 18:15:25,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:25,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:25,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) Second operand 63 states. [2022-02-20 18:15:25,361 INFO L87 Difference]: Start difference. First operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) Second operand 63 states. [2022-02-20 18:15:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:25,364 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2022-02-20 18:15:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-02-20 18:15:25,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:25,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:25,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:25,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-02-20 18:15:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2022-02-20 18:15:25,367 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2022-02-20 18:15:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:25,368 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2022-02-20 18:15:25,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-02-20 18:15:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-02-20 18:15:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:15:25,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:25,369 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:25,388 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:15:25,595 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:15:25,596 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:25,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2022-02-20 18:15:25,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:25,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303622418] [2022-02-20 18:15:25,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:25,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:25,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:25,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:25,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:25,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:25,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#true} assume !(~n < 1); {1718#true} is VALID [2022-02-20 18:15:25,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {1718#true} assume 1 == ~n;#res := 1; {1718#true} is VALID [2022-02-20 18:15:25,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:25,738 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1718#true} {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #49#return; {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:25,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:25,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#true} assume ~n < 1;#res := 0; {1718#true} is VALID [2022-02-20 18:15:25,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:25,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1718#true} {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #51#return; {1786#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#true} ~n := #in~n; {1774#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1775#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,748 INFO L272 TraceCheckUtils]: 3: Hoare triple {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {1718#true} is VALID [2022-02-20 18:15:25,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:25,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {1718#true} assume !(~n < 1); {1718#true} is VALID [2022-02-20 18:15:25,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {1718#true} assume 1 == ~n;#res := 1; {1718#true} is VALID [2022-02-20 18:15:25,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:25,749 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1718#true} {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #49#return; {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,749 INFO L272 TraceCheckUtils]: 10: Hoare triple {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {1718#true} is VALID [2022-02-20 18:15:25,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:25,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {1718#true} assume ~n < 1;#res := 0; {1718#true} is VALID [2022-02-20 18:15:25,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:25,750 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1718#true} {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #51#return; {1786#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {1786#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1786#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#(<= 2 |fibo2_#in~n|)} assume true; {1786#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,751 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1786#(<= 2 |fibo2_#in~n|)} {1718#true} #53#return; {1769#(<= 3 fibo1_~n)} is VALID [2022-02-20 18:15:25,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 18:15:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:25,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#true} ~n := #in~n; {1774#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {1787#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:25,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#(<= |fibo2_#in~n| 0)} assume true; {1787#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:25,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#(<= |fibo2_#in~n| 0)} {1769#(<= 3 fibo1_~n)} #55#return; {1719#false} is VALID [2022-02-20 18:15:25,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:25,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#true} assume !(~n < 1); {1718#true} is VALID [2022-02-20 18:15:25,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {1718#true} assume !(1 == ~n); {1718#true} is VALID [2022-02-20 18:15:25,764 INFO L272 TraceCheckUtils]: 3: Hoare triple {1718#true} call #t~ret4 := fibo2(~n - 1); {1718#true} is VALID [2022-02-20 18:15:25,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {1718#true} ~n := #in~n; {1774#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {1774#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1775#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {1775#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,765 INFO L272 TraceCheckUtils]: 7: Hoare triple {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {1718#true} is VALID [2022-02-20 18:15:25,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:25,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {1718#true} assume !(~n < 1); {1718#true} is VALID [2022-02-20 18:15:25,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {1718#true} assume 1 == ~n;#res := 1; {1718#true} is VALID [2022-02-20 18:15:25,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:25,765 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1718#true} {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #49#return; {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,766 INFO L272 TraceCheckUtils]: 14: Hoare triple {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {1718#true} is VALID [2022-02-20 18:15:25,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:25,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {1718#true} assume ~n < 1;#res := 0; {1718#true} is VALID [2022-02-20 18:15:25,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:25,767 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1718#true} {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #51#return; {1786#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {1786#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1786#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {1786#(<= 2 |fibo2_#in~n|)} assume true; {1786#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,768 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1786#(<= 2 |fibo2_#in~n|)} {1718#true} #53#return; {1769#(<= 3 fibo1_~n)} is VALID [2022-02-20 18:15:25,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {1769#(<= 3 fibo1_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1769#(<= 3 fibo1_~n)} is VALID [2022-02-20 18:15:25,768 INFO L272 TraceCheckUtils]: 23: Hoare triple {1769#(<= 3 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {1718#true} is VALID [2022-02-20 18:15:25,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {1718#true} ~n := #in~n; {1774#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {1774#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {1787#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:25,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {1787#(<= |fibo2_#in~n| 0)} assume true; {1787#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:25,770 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1787#(<= |fibo2_#in~n| 0)} {1769#(<= 3 fibo1_~n)} #55#return; {1719#false} is VALID [2022-02-20 18:15:25,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {1719#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1719#false} is VALID [2022-02-20 18:15:25,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {1719#false} assume true; {1719#false} is VALID [2022-02-20 18:15:25,770 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1719#false} {1718#true} #47#return; {1719#false} is VALID [2022-02-20 18:15:25,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#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(18, 2);call #Ultimate.allocInit(12, 3); {1718#true} is VALID [2022-02-20 18:15:25,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {1718#true} is VALID [2022-02-20 18:15:25,770 INFO L272 TraceCheckUtils]: 2: Hoare triple {1718#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1718#true} is VALID [2022-02-20 18:15:25,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:25,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {1718#true} assume !(~n < 1); {1718#true} is VALID [2022-02-20 18:15:25,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {1718#true} assume !(1 == ~n); {1718#true} is VALID [2022-02-20 18:15:25,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {1718#true} call #t~ret4 := fibo2(~n - 1); {1718#true} is VALID [2022-02-20 18:15:25,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {1718#true} ~n := #in~n; {1774#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {1774#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1775#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,772 INFO L272 TraceCheckUtils]: 10: Hoare triple {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {1718#true} is VALID [2022-02-20 18:15:25,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:25,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {1718#true} assume !(~n < 1); {1718#true} is VALID [2022-02-20 18:15:25,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {1718#true} assume 1 == ~n;#res := 1; {1718#true} is VALID [2022-02-20 18:15:25,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:25,772 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1718#true} {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #49#return; {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:25,773 INFO L272 TraceCheckUtils]: 17: Hoare triple {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {1718#true} is VALID [2022-02-20 18:15:25,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:25,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {1718#true} assume ~n < 1;#res := 0; {1718#true} is VALID [2022-02-20 18:15:25,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:25,773 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1718#true} {1776#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #51#return; {1786#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {1786#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1786#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {1786#(<= 2 |fibo2_#in~n|)} assume true; {1786#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,774 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1786#(<= 2 |fibo2_#in~n|)} {1718#true} #53#return; {1769#(<= 3 fibo1_~n)} is VALID [2022-02-20 18:15:25,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {1769#(<= 3 fibo1_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1769#(<= 3 fibo1_~n)} is VALID [2022-02-20 18:15:25,775 INFO L272 TraceCheckUtils]: 26: Hoare triple {1769#(<= 3 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {1718#true} is VALID [2022-02-20 18:15:25,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {1718#true} ~n := #in~n; {1774#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:25,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {1774#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {1787#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:25,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {1787#(<= |fibo2_#in~n| 0)} assume true; {1787#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:25,776 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1787#(<= |fibo2_#in~n| 0)} {1769#(<= 3 fibo1_~n)} #55#return; {1719#false} is VALID [2022-02-20 18:15:25,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {1719#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1719#false} is VALID [2022-02-20 18:15:25,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {1719#false} assume true; {1719#false} is VALID [2022-02-20 18:15:25,776 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1719#false} {1718#true} #47#return; {1719#false} is VALID [2022-02-20 18:15:25,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {1719#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1719#false} is VALID [2022-02-20 18:15:25,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {1719#false} assume 3 != main_~result~0#1; {1719#false} is VALID [2022-02-20 18:15:25,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {1719#false} assume !false; {1719#false} is VALID [2022-02-20 18:15:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 18:15:25,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:25,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303622418] [2022-02-20 18:15:25,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303622418] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:25,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739344365] [2022-02-20 18:15:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:25,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:25,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:25,778 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:15:25,791 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:15:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:25,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:15:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:25,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:26,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#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(18, 2);call #Ultimate.allocInit(12, 3); {1718#true} is VALID [2022-02-20 18:15:26,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {1794#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:26,038 INFO L272 TraceCheckUtils]: 2: Hoare triple {1794#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1718#true} is VALID [2022-02-20 18:15:26,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {1718#true} ~n := #in~n; {1801#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:26,038 INFO L290 TraceCheckUtils]: 4: Hoare triple {1801#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1801#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:26,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {1801#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {1801#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:26,039 INFO L272 TraceCheckUtils]: 6: Hoare triple {1801#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {1718#true} is VALID [2022-02-20 18:15:26,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {1718#true} ~n := #in~n; {1814#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:26,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {1814#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {1814#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:26,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {1814#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {1814#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:26,040 INFO L272 TraceCheckUtils]: 10: Hoare triple {1814#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {1718#true} is VALID [2022-02-20 18:15:26,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {1718#true} ~n := #in~n; {1801#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:26,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {1801#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1801#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:26,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {1801#(<= |fibo1_#in~n| fibo1_~n)} assume 1 == ~n;#res := 1; {1833#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:26,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {1833#(<= |fibo1_#in~n| 1)} assume true; {1833#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:26,042 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1833#(<= |fibo1_#in~n| 1)} {1814#(<= |fibo2_#in~n| fibo2_~n)} #49#return; {1840#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:26,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {1840#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1840#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:26,042 INFO L272 TraceCheckUtils]: 17: Hoare triple {1840#(<= |fibo2_#in~n| 2)} call #t~ret7 := fibo1(~n - 2); {1718#true} is VALID [2022-02-20 18:15:26,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:26,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {1718#true} assume ~n < 1;#res := 0; {1718#true} is VALID [2022-02-20 18:15:26,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:26,050 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1718#true} {1840#(<= |fibo2_#in~n| 2)} #51#return; {1840#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:26,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {1840#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1840#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:26,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {1840#(<= |fibo2_#in~n| 2)} assume true; {1840#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:26,052 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1840#(<= |fibo2_#in~n| 2)} {1801#(<= |fibo1_#in~n| fibo1_~n)} #53#return; {1868#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:26,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {1868#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1868#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:26,052 INFO L272 TraceCheckUtils]: 26: Hoare triple {1868#(<= |fibo1_#in~n| 3)} call #t~ret5 := fibo2(~n - 2); {1718#true} is VALID [2022-02-20 18:15:26,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:26,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {1718#true} assume ~n < 1;#res := 0; {1718#true} is VALID [2022-02-20 18:15:26,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:26,053 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1718#true} {1868#(<= |fibo1_#in~n| 3)} #55#return; {1868#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:26,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {1868#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1868#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:26,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {1868#(<= |fibo1_#in~n| 3)} assume true; {1868#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:26,054 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1868#(<= |fibo1_#in~n| 3)} {1794#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {1719#false} is VALID [2022-02-20 18:15:26,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {1719#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1719#false} is VALID [2022-02-20 18:15:26,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {1719#false} assume 3 != main_~result~0#1; {1719#false} is VALID [2022-02-20 18:15:26,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {1719#false} assume !false; {1719#false} is VALID [2022-02-20 18:15:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:15:26,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:26,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {1719#false} assume !false; {1719#false} is VALID [2022-02-20 18:15:26,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {1719#false} assume 3 != main_~result~0#1; {1719#false} is VALID [2022-02-20 18:15:26,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {1719#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1719#false} is VALID [2022-02-20 18:15:26,951 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1868#(<= |fibo1_#in~n| 3)} {1794#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {1719#false} is VALID [2022-02-20 18:15:26,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {1868#(<= |fibo1_#in~n| 3)} assume true; {1868#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:26,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {1868#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1868#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:26,952 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1718#true} {1868#(<= |fibo1_#in~n| 3)} #55#return; {1868#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:26,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:26,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {1718#true} assume ~n < 1;#res := 0; {1718#true} is VALID [2022-02-20 18:15:26,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:26,952 INFO L272 TraceCheckUtils]: 26: Hoare triple {1868#(<= |fibo1_#in~n| 3)} call #t~ret5 := fibo2(~n - 2); {1718#true} is VALID [2022-02-20 18:15:26,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {1868#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1868#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:26,953 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1840#(<= |fibo2_#in~n| 2)} {1944#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} #53#return; {1868#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:26,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {1840#(<= |fibo2_#in~n| 2)} assume true; {1840#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:26,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {1840#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1840#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:26,954 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1718#true} {1840#(<= |fibo2_#in~n| 2)} #51#return; {1840#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:26,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-02-20 18:15:26,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {1718#true} assume ~n < 1;#res := 0; {1718#true} is VALID [2022-02-20 18:15:26,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {1718#true} ~n := #in~n; {1718#true} is VALID [2022-02-20 18:15:26,954 INFO L272 TraceCheckUtils]: 17: Hoare triple {1840#(<= |fibo2_#in~n| 2)} call #t~ret7 := fibo1(~n - 2); {1718#true} is VALID [2022-02-20 18:15:26,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {1840#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1840#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:26,955 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1833#(<= |fibo1_#in~n| 1)} {1975#(or (<= |fibo2_#in~n| 2) (< 2 fibo2_~n))} #49#return; {1840#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:26,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {1833#(<= |fibo1_#in~n| 1)} assume true; {1833#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:26,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {1985#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} assume 1 == ~n;#res := 1; {1833#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:26,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {1985#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} assume !(~n < 1); {1985#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:26,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {1718#true} ~n := #in~n; {1985#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:26,956 INFO L272 TraceCheckUtils]: 10: Hoare triple {1975#(or (<= |fibo2_#in~n| 2) (< 2 fibo2_~n))} call #t~ret6 := fibo1(~n - 1); {1718#true} is VALID [2022-02-20 18:15:26,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {1975#(or (<= |fibo2_#in~n| 2) (< 2 fibo2_~n))} assume !(1 == ~n); {1975#(or (<= |fibo2_#in~n| 2) (< 2 fibo2_~n))} is VALID [2022-02-20 18:15:26,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {1975#(or (<= |fibo2_#in~n| 2) (< 2 fibo2_~n))} assume !(~n < 1); {1975#(or (<= |fibo2_#in~n| 2) (< 2 fibo2_~n))} is VALID [2022-02-20 18:15:26,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {1718#true} ~n := #in~n; {1975#(or (<= |fibo2_#in~n| 2) (< 2 fibo2_~n))} is VALID [2022-02-20 18:15:26,957 INFO L272 TraceCheckUtils]: 6: Hoare triple {1944#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} call #t~ret4 := fibo2(~n - 1); {1718#true} is VALID [2022-02-20 18:15:26,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} assume !(1 == ~n); {1944#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-20 18:15:26,958 INFO L290 TraceCheckUtils]: 4: Hoare triple {1944#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} assume !(~n < 1); {1944#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-20 18:15:26,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {1718#true} ~n := #in~n; {1944#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-20 18:15:26,958 INFO L272 TraceCheckUtils]: 2: Hoare triple {1794#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1718#true} is VALID [2022-02-20 18:15:26,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {1794#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:26,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#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(18, 2);call #Ultimate.allocInit(12, 3); {1718#true} is VALID [2022-02-20 18:15:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 18:15:26,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739344365] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:26,959 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:26,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2022-02-20 18:15:26,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145354446] [2022-02-20 18:15:26,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) Word has length 37 [2022-02-20 18:15:26,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:26,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-20 18:15:27,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:27,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 18:15:27,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:27,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 18:15:27,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:15:27,002 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-20 18:15:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:28,064 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2022-02-20 18:15:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 18:15:28,064 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) Word has length 37 [2022-02-20 18:15:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-20 18:15:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 130 transitions. [2022-02-20 18:15:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-20 18:15:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 130 transitions. [2022-02-20 18:15:28,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 130 transitions. [2022-02-20 18:15:28,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:28,171 INFO L225 Difference]: With dead ends: 177 [2022-02-20 18:15:28,171 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 18:15:28,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:15:28,172 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 45 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:28,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 275 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:15:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 18:15:28,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-02-20 18:15:28,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:28,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2022-02-20 18:15:28,218 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2022-02-20 18:15:28,218 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2022-02-20 18:15:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:28,223 INFO L93 Difference]: Finished difference Result 117 states and 195 transitions. [2022-02-20 18:15:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 195 transitions. [2022-02-20 18:15:28,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:28,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:28,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) Second operand 117 states. [2022-02-20 18:15:28,225 INFO L87 Difference]: Start difference. First operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) Second operand 117 states. [2022-02-20 18:15:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:28,230 INFO L93 Difference]: Finished difference Result 117 states and 195 transitions. [2022-02-20 18:15:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 195 transitions. [2022-02-20 18:15:28,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:28,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:28,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:28,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2022-02-20 18:15:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2022-02-20 18:15:28,235 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2022-02-20 18:15:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:28,236 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2022-02-20 18:15:28,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-20 18:15:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2022-02-20 18:15:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:15:28,237 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:28,237 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:28,255 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:15:28,451 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:15:28,452 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2022-02-20 18:15:28,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:28,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404986985] [2022-02-20 18:15:28,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:28,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:28,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:28,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:28,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,621 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2625#true} {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #53#return; {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:28,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {2625#true} assume ~n < 1;#res := 0; {2625#true} is VALID [2022-02-20 18:15:28,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2625#true} {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #55#return; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#true} ~n := #in~n; {2732#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {2732#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2733#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-20 18:15:28,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {2733#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,626 INFO L272 TraceCheckUtils]: 3: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {2625#true} is VALID [2022-02-20 18:15:28,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:28,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,639 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2625#true} {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #53#return; {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,640 INFO L272 TraceCheckUtils]: 10: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {2625#true} is VALID [2022-02-20 18:15:28,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {2625#true} assume ~n < 1;#res := 0; {2625#true} is VALID [2022-02-20 18:15:28,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,641 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2625#true} {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #55#return; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {2744#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {2744#(<= 2 |fibo1_#in~n|)} assume true; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,642 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2744#(<= 2 |fibo1_#in~n|)} {2625#true} #49#return; {2727#(<= 3 fibo2_~n)} is VALID [2022-02-20 18:15:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 18:15:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:28,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#true} ~n := #in~n; {2732#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {2732#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:28,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {2745#(<= |fibo1_#in~n| 0)} assume true; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:28,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2745#(<= |fibo1_#in~n| 0)} {2727#(<= 3 fibo2_~n)} #51#return; {2626#false} is VALID [2022-02-20 18:15:28,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {2625#true} assume !(1 == ~n); {2625#true} is VALID [2022-02-20 18:15:28,654 INFO L272 TraceCheckUtils]: 3: Hoare triple {2625#true} call #t~ret6 := fibo1(~n - 1); {2625#true} is VALID [2022-02-20 18:15:28,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {2625#true} ~n := #in~n; {2732#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {2732#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2733#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-20 18:15:28,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {2733#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,655 INFO L272 TraceCheckUtils]: 7: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {2625#true} is VALID [2022-02-20 18:15:28,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:28,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,656 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2625#true} {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #53#return; {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,656 INFO L272 TraceCheckUtils]: 14: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {2625#true} is VALID [2022-02-20 18:15:28,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {2625#true} assume ~n < 1;#res := 0; {2625#true} is VALID [2022-02-20 18:15:28,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,657 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2625#true} {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #55#return; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {2744#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {2744#(<= 2 |fibo1_#in~n|)} assume true; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,658 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2744#(<= 2 |fibo1_#in~n|)} {2625#true} #49#return; {2727#(<= 3 fibo2_~n)} is VALID [2022-02-20 18:15:28,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {2727#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {2727#(<= 3 fibo2_~n)} is VALID [2022-02-20 18:15:28,658 INFO L272 TraceCheckUtils]: 23: Hoare triple {2727#(<= 3 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {2625#true} is VALID [2022-02-20 18:15:28,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {2625#true} ~n := #in~n; {2732#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {2732#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:28,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {2745#(<= |fibo1_#in~n| 0)} assume true; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:28,660 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2745#(<= |fibo1_#in~n| 0)} {2727#(<= 3 fibo2_~n)} #51#return; {2626#false} is VALID [2022-02-20 18:15:28,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {2626#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {2626#false} is VALID [2022-02-20 18:15:28,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {2626#false} assume true; {2626#false} is VALID [2022-02-20 18:15:28,660 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2626#false} {2625#true} #53#return; {2626#false} is VALID [2022-02-20 18:15:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 18:15:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:28,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:28,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,670 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2625#true} {2626#false} #55#return; {2626#false} is VALID [2022-02-20 18:15:28,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {2625#true} assume !(1 == ~n); {2625#true} is VALID [2022-02-20 18:15:28,670 INFO L272 TraceCheckUtils]: 3: Hoare triple {2625#true} call #t~ret4 := fibo2(~n - 1); {2625#true} is VALID [2022-02-20 18:15:28,670 INFO L290 TraceCheckUtils]: 4: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {2625#true} assume !(1 == ~n); {2625#true} is VALID [2022-02-20 18:15:28,670 INFO L272 TraceCheckUtils]: 7: Hoare triple {2625#true} call #t~ret6 := fibo1(~n - 1); {2625#true} is VALID [2022-02-20 18:15:28,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {2625#true} ~n := #in~n; {2732#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {2732#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2733#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-20 18:15:28,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {2733#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,671 INFO L272 TraceCheckUtils]: 11: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {2625#true} is VALID [2022-02-20 18:15:28,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:28,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,672 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2625#true} {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #53#return; {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,672 INFO L272 TraceCheckUtils]: 18: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {2625#true} is VALID [2022-02-20 18:15:28,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {2625#true} assume ~n < 1;#res := 0; {2625#true} is VALID [2022-02-20 18:15:28,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,673 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2625#true} {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #55#return; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {2744#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {2744#(<= 2 |fibo1_#in~n|)} assume true; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,674 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2744#(<= 2 |fibo1_#in~n|)} {2625#true} #49#return; {2727#(<= 3 fibo2_~n)} is VALID [2022-02-20 18:15:28,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {2727#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {2727#(<= 3 fibo2_~n)} is VALID [2022-02-20 18:15:28,675 INFO L272 TraceCheckUtils]: 27: Hoare triple {2727#(<= 3 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {2625#true} is VALID [2022-02-20 18:15:28,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {2625#true} ~n := #in~n; {2732#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {2732#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:28,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {2745#(<= |fibo1_#in~n| 0)} assume true; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:28,688 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2745#(<= |fibo1_#in~n| 0)} {2727#(<= 3 fibo2_~n)} #51#return; {2626#false} is VALID [2022-02-20 18:15:28,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {2626#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {2626#false} is VALID [2022-02-20 18:15:28,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {2626#false} assume true; {2626#false} is VALID [2022-02-20 18:15:28,689 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2626#false} {2625#true} #53#return; {2626#false} is VALID [2022-02-20 18:15:28,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {2626#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2626#false} is VALID [2022-02-20 18:15:28,689 INFO L272 TraceCheckUtils]: 36: Hoare triple {2626#false} call #t~ret5 := fibo2(~n - 2); {2625#true} is VALID [2022-02-20 18:15:28,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:28,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,689 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2625#true} {2626#false} #55#return; {2626#false} is VALID [2022-02-20 18:15:28,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {2626#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2626#false} is VALID [2022-02-20 18:15:28,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {2626#false} assume true; {2626#false} is VALID [2022-02-20 18:15:28,689 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2626#false} {2627#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {2626#false} is VALID [2022-02-20 18:15:28,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#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(18, 2);call #Ultimate.allocInit(12, 3); {2625#true} is VALID [2022-02-20 18:15:28,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {2625#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {2627#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:28,690 INFO L272 TraceCheckUtils]: 2: Hoare triple {2627#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {2625#true} is VALID [2022-02-20 18:15:28,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {2625#true} assume !(1 == ~n); {2625#true} is VALID [2022-02-20 18:15:28,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {2625#true} call #t~ret4 := fibo2(~n - 1); {2625#true} is VALID [2022-02-20 18:15:28,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {2625#true} assume !(1 == ~n); {2625#true} is VALID [2022-02-20 18:15:28,690 INFO L272 TraceCheckUtils]: 10: Hoare triple {2625#true} call #t~ret6 := fibo1(~n - 1); {2625#true} is VALID [2022-02-20 18:15:28,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {2625#true} ~n := #in~n; {2732#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {2732#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2733#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-20 18:15:28,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {2733#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,691 INFO L272 TraceCheckUtils]: 14: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {2625#true} is VALID [2022-02-20 18:15:28,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:28,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,692 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2625#true} {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #53#return; {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:28,692 INFO L272 TraceCheckUtils]: 21: Hoare triple {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {2625#true} is VALID [2022-02-20 18:15:28,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {2625#true} assume ~n < 1;#res := 0; {2625#true} is VALID [2022-02-20 18:15:28,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,693 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2625#true} {2734#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #55#return; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {2744#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {2744#(<= 2 |fibo1_#in~n|)} assume true; {2744#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,694 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2744#(<= 2 |fibo1_#in~n|)} {2625#true} #49#return; {2727#(<= 3 fibo2_~n)} is VALID [2022-02-20 18:15:28,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {2727#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {2727#(<= 3 fibo2_~n)} is VALID [2022-02-20 18:15:28,694 INFO L272 TraceCheckUtils]: 30: Hoare triple {2727#(<= 3 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {2625#true} is VALID [2022-02-20 18:15:28,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {2625#true} ~n := #in~n; {2732#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:28,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {2732#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:28,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {2745#(<= |fibo1_#in~n| 0)} assume true; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:28,696 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2745#(<= |fibo1_#in~n| 0)} {2727#(<= 3 fibo2_~n)} #51#return; {2626#false} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {2626#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {2626#false} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {2626#false} assume true; {2626#false} is VALID [2022-02-20 18:15:28,696 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2626#false} {2625#true} #53#return; {2626#false} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {2626#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2626#false} is VALID [2022-02-20 18:15:28,696 INFO L272 TraceCheckUtils]: 39: Hoare triple {2626#false} call #t~ret5 := fibo2(~n - 2); {2625#true} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:28,696 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2625#true} {2626#false} #55#return; {2626#false} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {2626#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2626#false} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {2626#false} assume true; {2626#false} is VALID [2022-02-20 18:15:28,696 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2626#false} {2627#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {2626#false} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {2626#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {2626#false} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 49: Hoare triple {2626#false} assume 3 != main_~result~0#1; {2626#false} is VALID [2022-02-20 18:15:28,696 INFO L290 TraceCheckUtils]: 50: Hoare triple {2626#false} assume !false; {2626#false} is VALID [2022-02-20 18:15:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-20 18:15:28,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:28,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404986985] [2022-02-20 18:15:28,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404986985] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:28,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744772162] [2022-02-20 18:15:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:28,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:28,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:28,705 INFO L229 MonitoredProcess]: Starting monitored process 6 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:15:28,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 18:15:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:28,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:15:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:28,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:28,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#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(18, 2);call #Ultimate.allocInit(12, 3); {2625#true} is VALID [2022-02-20 18:15:28,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {2625#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {2627#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:28,997 INFO L272 TraceCheckUtils]: 2: Hoare triple {2627#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {2625#true} is VALID [2022-02-20 18:15:28,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {2625#true} ~n := #in~n; {2758#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:28,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {2758#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {2758#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:28,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {2758#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {2758#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:28,998 INFO L272 TraceCheckUtils]: 6: Hoare triple {2758#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {2625#true} is VALID [2022-02-20 18:15:28,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {2625#true} ~n := #in~n; {2771#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:28,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {2771#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {2771#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:28,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {2771#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {2771#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:28,999 INFO L272 TraceCheckUtils]: 10: Hoare triple {2771#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {2625#true} is VALID [2022-02-20 18:15:28,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:28,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:28,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {2625#true} assume !(1 == ~n); {2625#true} is VALID [2022-02-20 18:15:28,999 INFO L272 TraceCheckUtils]: 14: Hoare triple {2625#true} call #t~ret4 := fibo2(~n - 1); {2625#true} is VALID [2022-02-20 18:15:29,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:29,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:29,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:29,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:29,001 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2625#true} {2625#true} #53#return; {2625#true} is VALID [2022-02-20 18:15:29,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {2625#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2625#true} is VALID [2022-02-20 18:15:29,001 INFO L272 TraceCheckUtils]: 21: Hoare triple {2625#true} call #t~ret5 := fibo2(~n - 2); {2625#true} is VALID [2022-02-20 18:15:29,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:29,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {2625#true} assume ~n < 1;#res := 0; {2625#true} is VALID [2022-02-20 18:15:29,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:29,001 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2625#true} {2625#true} #55#return; {2625#true} is VALID [2022-02-20 18:15:29,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {2625#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2625#true} is VALID [2022-02-20 18:15:29,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:29,002 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2625#true} {2771#(<= |fibo2_#in~n| fibo2_~n)} #49#return; {2771#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:29,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {2771#(<= |fibo2_#in~n| fibo2_~n)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {2771#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:29,002 INFO L272 TraceCheckUtils]: 30: Hoare triple {2771#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {2625#true} is VALID [2022-02-20 18:15:29,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {2625#true} ~n := #in~n; {2758#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:29,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {2758#(<= |fibo1_#in~n| fibo1_~n)} assume ~n < 1;#res := 0; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:29,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {2745#(<= |fibo1_#in~n| 0)} assume true; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:29,004 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2745#(<= |fibo1_#in~n| 0)} {2771#(<= |fibo2_#in~n| fibo2_~n)} #51#return; {2853#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:29,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {2853#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {2853#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:29,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {2853#(<= |fibo2_#in~n| 2)} assume true; {2853#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:29,006 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2853#(<= |fibo2_#in~n| 2)} {2758#(<= |fibo1_#in~n| fibo1_~n)} #53#return; {2863#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:29,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {2863#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2863#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:29,007 INFO L272 TraceCheckUtils]: 39: Hoare triple {2863#(<= |fibo1_#in~n| 3)} call #t~ret5 := fibo2(~n - 2); {2625#true} is VALID [2022-02-20 18:15:29,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:29,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:29,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:29,007 INFO L290 TraceCheckUtils]: 43: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:29,007 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2625#true} {2863#(<= |fibo1_#in~n| 3)} #55#return; {2863#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:29,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {2863#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2863#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:29,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {2863#(<= |fibo1_#in~n| 3)} assume true; {2863#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:29,008 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2863#(<= |fibo1_#in~n| 3)} {2627#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {2626#false} is VALID [2022-02-20 18:15:29,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {2626#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {2626#false} is VALID [2022-02-20 18:15:29,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {2626#false} assume 3 != main_~result~0#1; {2626#false} is VALID [2022-02-20 18:15:29,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {2626#false} assume !false; {2626#false} is VALID [2022-02-20 18:15:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 18:15:29,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:30,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {2626#false} assume !false; {2626#false} is VALID [2022-02-20 18:15:30,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {2626#false} assume 3 != main_~result~0#1; {2626#false} is VALID [2022-02-20 18:15:30,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {2626#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {2626#false} is VALID [2022-02-20 18:15:30,166 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2863#(<= |fibo1_#in~n| 3)} {2627#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {2626#false} is VALID [2022-02-20 18:15:30,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {2863#(<= |fibo1_#in~n| 3)} assume true; {2863#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:30,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {2863#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2863#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:30,167 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2625#true} {2863#(<= |fibo1_#in~n| 3)} #55#return; {2863#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:30,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:30,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:30,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:30,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:30,167 INFO L272 TraceCheckUtils]: 39: Hoare triple {2863#(<= |fibo1_#in~n| 3)} call #t~ret5 := fibo2(~n - 2); {2625#true} is VALID [2022-02-20 18:15:30,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {2863#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2863#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:30,168 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2853#(<= |fibo2_#in~n| 2)} {2945#(or (<= 4 fibo1_~n) (<= |fibo1_#in~n| 3))} #53#return; {2863#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:30,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {2853#(<= |fibo2_#in~n| 2)} assume true; {2853#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:30,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {2853#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {2853#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:30,169 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2745#(<= |fibo1_#in~n| 0)} {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} #51#return; {2853#(<= |fibo2_#in~n| 2)} is VALID [2022-02-20 18:15:30,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {2745#(<= |fibo1_#in~n| 0)} assume true; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:30,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {2968#(or (<= |fibo1_#in~n| 0) (not (< fibo1_~n 1)))} assume ~n < 1;#res := 0; {2745#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:30,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {2625#true} ~n := #in~n; {2968#(or (<= |fibo1_#in~n| 0) (not (< fibo1_~n 1)))} is VALID [2022-02-20 18:15:30,175 INFO L272 TraceCheckUtils]: 30: Hoare triple {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} call #t~ret7 := fibo1(~n - 2); {2625#true} is VALID [2022-02-20 18:15:30,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-20 18:15:30,176 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2625#true} {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} #49#return; {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-20 18:15:30,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:30,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {2625#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2625#true} is VALID [2022-02-20 18:15:30,176 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2625#true} {2625#true} #55#return; {2625#true} is VALID [2022-02-20 18:15:30,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:30,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {2625#true} assume ~n < 1;#res := 0; {2625#true} is VALID [2022-02-20 18:15:30,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:30,176 INFO L272 TraceCheckUtils]: 21: Hoare triple {2625#true} call #t~ret5 := fibo2(~n - 2); {2625#true} is VALID [2022-02-20 18:15:30,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {2625#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2625#true} is VALID [2022-02-20 18:15:30,184 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2625#true} {2625#true} #53#return; {2625#true} is VALID [2022-02-20 18:15:30,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {2625#true} assume true; {2625#true} is VALID [2022-02-20 18:15:30,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {2625#true} assume 1 == ~n;#res := 1; {2625#true} is VALID [2022-02-20 18:15:30,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:30,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:30,184 INFO L272 TraceCheckUtils]: 14: Hoare triple {2625#true} call #t~ret4 := fibo2(~n - 1); {2625#true} is VALID [2022-02-20 18:15:30,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {2625#true} assume !(1 == ~n); {2625#true} is VALID [2022-02-20 18:15:30,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {2625#true} assume !(~n < 1); {2625#true} is VALID [2022-02-20 18:15:30,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {2625#true} ~n := #in~n; {2625#true} is VALID [2022-02-20 18:15:30,184 INFO L272 TraceCheckUtils]: 10: Hoare triple {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} call #t~ret6 := fibo1(~n - 1); {2625#true} is VALID [2022-02-20 18:15:30,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(1 == ~n); {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-20 18:15:30,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(~n < 1); {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-20 18:15:30,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {2625#true} ~n := #in~n; {2958#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-20 18:15:30,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {2945#(or (<= 4 fibo1_~n) (<= |fibo1_#in~n| 3))} call #t~ret4 := fibo2(~n - 1); {2625#true} is VALID [2022-02-20 18:15:30,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {2945#(or (<= 4 fibo1_~n) (<= |fibo1_#in~n| 3))} assume !(1 == ~n); {2945#(or (<= 4 fibo1_~n) (<= |fibo1_#in~n| 3))} is VALID [2022-02-20 18:15:30,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {2945#(or (<= 4 fibo1_~n) (<= |fibo1_#in~n| 3))} assume !(~n < 1); {2945#(or (<= 4 fibo1_~n) (<= |fibo1_#in~n| 3))} is VALID [2022-02-20 18:15:30,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {2625#true} ~n := #in~n; {2945#(or (<= 4 fibo1_~n) (<= |fibo1_#in~n| 3))} is VALID [2022-02-20 18:15:30,186 INFO L272 TraceCheckUtils]: 2: Hoare triple {2627#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {2625#true} is VALID [2022-02-20 18:15:30,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {2625#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {2627#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:30,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#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(18, 2);call #Ultimate.allocInit(12, 3); {2625#true} is VALID [2022-02-20 18:15:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-20 18:15:30,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744772162] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:30,187 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:30,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2022-02-20 18:15:30,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075306648] [2022-02-20 18:15:30,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:30,189 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) Word has length 51 [2022-02-20 18:15:30,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:30,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2022-02-20 18:15:30,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:30,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 18:15:30,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:30,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 18:15:30,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:15:30,270 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2022-02-20 18:15:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:30,941 INFO L93 Difference]: Finished difference Result 262 states and 508 transitions. [2022-02-20 18:15:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:15:30,941 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) Word has length 51 [2022-02-20 18:15:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2022-02-20 18:15:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-02-20 18:15:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2022-02-20 18:15:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-02-20 18:15:30,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 119 transitions. [2022-02-20 18:15:31,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:31,051 INFO L225 Difference]: With dead ends: 262 [2022-02-20 18:15:31,051 INFO L226 Difference]: Without dead ends: 162 [2022-02-20 18:15:31,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:15:31,052 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:31,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 181 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:15:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-02-20 18:15:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 139. [2022-02-20 18:15:31,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:31,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 139 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 31 states have call successors, (31), 10 states have call predecessors, (31), 18 states have return successors, (103), 37 states have call predecessors, (103), 31 states have call successors, (103) [2022-02-20 18:15:31,136 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 139 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 31 states have call successors, (31), 10 states have call predecessors, (31), 18 states have return successors, (103), 37 states have call predecessors, (103), 31 states have call successors, (103) [2022-02-20 18:15:31,136 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 139 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 31 states have call successors, (31), 10 states have call predecessors, (31), 18 states have return successors, (103), 37 states have call predecessors, (103), 31 states have call successors, (103) [2022-02-20 18:15:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:31,144 INFO L93 Difference]: Finished difference Result 162 states and 282 transitions. [2022-02-20 18:15:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 282 transitions. [2022-02-20 18:15:31,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:31,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:31,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 31 states have call successors, (31), 10 states have call predecessors, (31), 18 states have return successors, (103), 37 states have call predecessors, (103), 31 states have call successors, (103) Second operand 162 states. [2022-02-20 18:15:31,146 INFO L87 Difference]: Start difference. First operand has 139 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 31 states have call successors, (31), 10 states have call predecessors, (31), 18 states have return successors, (103), 37 states have call predecessors, (103), 31 states have call successors, (103) Second operand 162 states. [2022-02-20 18:15:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:31,153 INFO L93 Difference]: Finished difference Result 162 states and 282 transitions. [2022-02-20 18:15:31,154 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 282 transitions. [2022-02-20 18:15:31,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:31,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:31,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:31,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 31 states have call successors, (31), 10 states have call predecessors, (31), 18 states have return successors, (103), 37 states have call predecessors, (103), 31 states have call successors, (103) [2022-02-20 18:15:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 241 transitions. [2022-02-20 18:15:31,161 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 241 transitions. Word has length 51 [2022-02-20 18:15:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:31,162 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 241 transitions. [2022-02-20 18:15:31,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2022-02-20 18:15:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2022-02-20 18:15:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:15:31,163 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:31,164 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:31,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:31,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:31,382 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:31,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1130362923, now seen corresponding path program 1 times [2022-02-20 18:15:31,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:31,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932397745] [2022-02-20 18:15:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:31,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:31,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:31,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:31,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,510 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3906#true} {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #53#return; {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:31,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} assume ~n < 1;#res := 0; {3906#true} is VALID [2022-02-20 18:15:31,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3906#true} {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #55#return; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#true} ~n := #in~n; {4019#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {4019#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4020#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-20 18:15:31,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {4020#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,517 INFO L272 TraceCheckUtils]: 3: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,517 INFO L290 TraceCheckUtils]: 4: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:31,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,518 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3906#true} {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #53#return; {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,519 INFO L272 TraceCheckUtils]: 10: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {3906#true} assume ~n < 1;#res := 0; {3906#true} is VALID [2022-02-20 18:15:31,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,520 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3906#true} {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #55#return; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {4031#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {4031#(<= 2 |fibo1_#in~n|)} assume true; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,521 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4031#(<= 2 |fibo1_#in~n|)} {3993#(= fibo2_~n |fibo2_#in~n|)} #49#return; {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:31,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 18:15:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:31,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:31,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,526 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3906#true} {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #51#return; {4018#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#true} ~n := #in~n; {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,527 INFO L272 TraceCheckUtils]: 3: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {3906#true} ~n := #in~n; {4019#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {4019#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4020#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-20 18:15:31,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {4020#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,528 INFO L272 TraceCheckUtils]: 7: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:31,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,529 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3906#true} {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #53#return; {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,530 INFO L272 TraceCheckUtils]: 14: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {3906#true} assume ~n < 1;#res := 0; {3906#true} is VALID [2022-02-20 18:15:31,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,531 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3906#true} {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #55#return; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {4031#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {4031#(<= 2 |fibo1_#in~n|)} assume true; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,532 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4031#(<= 2 |fibo1_#in~n|)} {3993#(= fibo2_~n |fibo2_#in~n|)} #49#return; {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:31,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:31,532 INFO L272 TraceCheckUtils]: 23: Hoare triple {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:31,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,533 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3906#true} {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #51#return; {4018#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {4018#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {4018#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {4018#(<= 3 |fibo2_#in~n|)} assume true; {4018#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,535 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4018#(<= 3 |fibo2_#in~n|)} {3906#true} #53#return; {3987#(<= 4 fibo1_~n)} is VALID [2022-02-20 18:15:31,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-20 18:15:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:31,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#true} ~n := #in~n; {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4032#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:31,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {4032#(<= |fibo2_#in~n| 1)} assume true; {4032#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:31,549 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4032#(<= |fibo2_#in~n| 1)} {3987#(<= 4 fibo1_~n)} #55#return; {3907#false} is VALID [2022-02-20 18:15:31,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {3906#true} assume !(1 == ~n); {3906#true} is VALID [2022-02-20 18:15:31,550 INFO L272 TraceCheckUtils]: 3: Hoare triple {3906#true} call #t~ret4 := fibo2(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {3906#true} ~n := #in~n; {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,551 INFO L272 TraceCheckUtils]: 7: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {3906#true} ~n := #in~n; {4019#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {4019#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4020#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-20 18:15:31,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {4020#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,552 INFO L272 TraceCheckUtils]: 11: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:31,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,553 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3906#true} {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #53#return; {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,553 INFO L272 TraceCheckUtils]: 18: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {3906#true} assume ~n < 1;#res := 0; {3906#true} is VALID [2022-02-20 18:15:31,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,554 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3906#true} {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #55#return; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {4031#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {4031#(<= 2 |fibo1_#in~n|)} assume true; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,555 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4031#(<= 2 |fibo1_#in~n|)} {3993#(= fibo2_~n |fibo2_#in~n|)} #49#return; {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:31,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:31,556 INFO L272 TraceCheckUtils]: 27: Hoare triple {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:31,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,557 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3906#true} {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #51#return; {4018#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {4018#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {4018#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {4018#(<= 3 |fibo2_#in~n|)} assume true; {4018#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,558 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4018#(<= 3 |fibo2_#in~n|)} {3906#true} #53#return; {3987#(<= 4 fibo1_~n)} is VALID [2022-02-20 18:15:31,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {3987#(<= 4 fibo1_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3987#(<= 4 fibo1_~n)} is VALID [2022-02-20 18:15:31,558 INFO L272 TraceCheckUtils]: 37: Hoare triple {3987#(<= 4 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {3906#true} ~n := #in~n; {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4032#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:31,559 INFO L290 TraceCheckUtils]: 41: Hoare triple {4032#(<= |fibo2_#in~n| 1)} assume true; {4032#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:31,560 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4032#(<= |fibo2_#in~n| 1)} {3987#(<= 4 fibo1_~n)} #55#return; {3907#false} is VALID [2022-02-20 18:15:31,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {3907#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3907#false} is VALID [2022-02-20 18:15:31,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {3907#false} assume true; {3907#false} is VALID [2022-02-20 18:15:31,560 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3907#false} {3908#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {3907#false} is VALID [2022-02-20 18:15:31,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#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(18, 2);call #Ultimate.allocInit(12, 3); {3906#true} is VALID [2022-02-20 18:15:31,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {3908#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:31,561 INFO L272 TraceCheckUtils]: 2: Hoare triple {3908#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {3906#true} is VALID [2022-02-20 18:15:31,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {3906#true} assume !(1 == ~n); {3906#true} is VALID [2022-02-20 18:15:31,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {3906#true} call #t~ret4 := fibo2(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {3906#true} ~n := #in~n; {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,562 INFO L272 TraceCheckUtils]: 10: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {3906#true} ~n := #in~n; {4019#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {4019#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4020#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-20 18:15:31,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {4020#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,564 INFO L272 TraceCheckUtils]: 14: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:31,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,565 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3906#true} {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #53#return; {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-20 18:15:31,565 INFO L272 TraceCheckUtils]: 21: Hoare triple {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {3906#true} assume ~n < 1;#res := 0; {3906#true} is VALID [2022-02-20 18:15:31,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,566 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3906#true} {4021#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #55#return; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {4031#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {4031#(<= 2 |fibo1_#in~n|)} assume true; {4031#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:31,568 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4031#(<= 2 |fibo1_#in~n|)} {3993#(= fibo2_~n |fibo2_#in~n|)} #49#return; {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:31,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:31,568 INFO L272 TraceCheckUtils]: 30: Hoare triple {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:31,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,569 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3906#true} {4012#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #51#return; {4018#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {4018#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {4018#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {4018#(<= 3 |fibo2_#in~n|)} assume true; {4018#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,570 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4018#(<= 3 |fibo2_#in~n|)} {3906#true} #53#return; {3987#(<= 4 fibo1_~n)} is VALID [2022-02-20 18:15:31,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {3987#(<= 4 fibo1_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3987#(<= 4 fibo1_~n)} is VALID [2022-02-20 18:15:31,570 INFO L272 TraceCheckUtils]: 40: Hoare triple {3987#(<= 4 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {3906#true} ~n := #in~n; {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3993#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:31,571 INFO L290 TraceCheckUtils]: 43: Hoare triple {3993#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4032#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:31,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {4032#(<= |fibo2_#in~n| 1)} assume true; {4032#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:31,572 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4032#(<= |fibo2_#in~n| 1)} {3987#(<= 4 fibo1_~n)} #55#return; {3907#false} is VALID [2022-02-20 18:15:31,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {3907#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3907#false} is VALID [2022-02-20 18:15:31,572 INFO L290 TraceCheckUtils]: 47: Hoare triple {3907#false} assume true; {3907#false} is VALID [2022-02-20 18:15:31,572 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3907#false} {3908#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {3907#false} is VALID [2022-02-20 18:15:31,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {3907#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {3907#false} is VALID [2022-02-20 18:15:31,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {3907#false} assume 3 != main_~result~0#1; {3907#false} is VALID [2022-02-20 18:15:31,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {3907#false} assume !false; {3907#false} is VALID [2022-02-20 18:15:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 18:15:31,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:31,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932397745] [2022-02-20 18:15:31,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932397745] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:31,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813782469] [2022-02-20 18:15:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:31,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:31,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:31,575 INFO L229 MonitoredProcess]: Starting monitored process 7 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:15:31,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 18:15:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:31,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:15:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:31,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:31,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#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(18, 2);call #Ultimate.allocInit(12, 3); {3906#true} is VALID [2022-02-20 18:15:31,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {3908#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:31,828 INFO L272 TraceCheckUtils]: 2: Hoare triple {3908#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {3906#true} is VALID [2022-02-20 18:15:31,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {3906#true} ~n := #in~n; {4045#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:31,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {4045#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {4045#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:31,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {4045#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {4045#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:31,829 INFO L272 TraceCheckUtils]: 6: Hoare triple {4045#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {3906#true} assume !(1 == ~n); {3906#true} is VALID [2022-02-20 18:15:31,829 INFO L272 TraceCheckUtils]: 10: Hoare triple {3906#true} call #t~ret6 := fibo1(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {3906#true} assume !(1 == ~n); {3906#true} is VALID [2022-02-20 18:15:31,830 INFO L272 TraceCheckUtils]: 14: Hoare triple {3906#true} call #t~ret4 := fibo2(~n - 1); {3906#true} is VALID [2022-02-20 18:15:31,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:31,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,830 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3906#true} {3906#true} #53#return; {3906#true} is VALID [2022-02-20 18:15:31,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {3906#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3906#true} is VALID [2022-02-20 18:15:31,831 INFO L272 TraceCheckUtils]: 21: Hoare triple {3906#true} call #t~ret5 := fibo2(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {3906#true} assume ~n < 1;#res := 0; {3906#true} is VALID [2022-02-20 18:15:31,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,831 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3906#true} {3906#true} #55#return; {3906#true} is VALID [2022-02-20 18:15:31,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {3906#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3906#true} is VALID [2022-02-20 18:15:31,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,831 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3906#true} {3906#true} #49#return; {3906#true} is VALID [2022-02-20 18:15:31,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {3906#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {3906#true} is VALID [2022-02-20 18:15:31,832 INFO L272 TraceCheckUtils]: 30: Hoare triple {3906#true} call #t~ret7 := fibo1(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:31,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:31,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:31,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,832 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3906#true} {3906#true} #51#return; {3906#true} is VALID [2022-02-20 18:15:31,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {3906#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {3906#true} is VALID [2022-02-20 18:15:31,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:31,833 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3906#true} {4045#(<= |fibo1_#in~n| fibo1_~n)} #53#return; {4045#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:31,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {4045#(<= |fibo1_#in~n| fibo1_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4045#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:31,834 INFO L272 TraceCheckUtils]: 40: Hoare triple {4045#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {3906#true} is VALID [2022-02-20 18:15:31,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {3906#true} ~n := #in~n; {4160#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:31,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {4160#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {4160#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:31,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {4160#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {4032#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:31,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {4032#(<= |fibo2_#in~n| 1)} assume true; {4032#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:31,836 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4032#(<= |fibo2_#in~n| 1)} {4045#(<= |fibo1_#in~n| fibo1_~n)} #55#return; {4173#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:31,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {4173#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4173#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:31,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {4173#(<= |fibo1_#in~n| 3)} assume true; {4173#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:31,837 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4173#(<= |fibo1_#in~n| 3)} {3908#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {3907#false} is VALID [2022-02-20 18:15:31,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {3907#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {3907#false} is VALID [2022-02-20 18:15:31,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {3907#false} assume 3 != main_~result~0#1; {3907#false} is VALID [2022-02-20 18:15:31,837 INFO L290 TraceCheckUtils]: 51: Hoare triple {3907#false} assume !false; {3907#false} is VALID [2022-02-20 18:15:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-20 18:15:31,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:32,407 INFO L290 TraceCheckUtils]: 51: Hoare triple {3907#false} assume !false; {3907#false} is VALID [2022-02-20 18:15:32,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {3907#false} assume 3 != main_~result~0#1; {3907#false} is VALID [2022-02-20 18:15:32,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {3907#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {3907#false} is VALID [2022-02-20 18:15:32,408 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4173#(<= |fibo1_#in~n| 3)} {3908#(<= 4 |ULTIMATE.start_main_~x~0#1|)} #47#return; {3907#false} is VALID [2022-02-20 18:15:32,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {4173#(<= |fibo1_#in~n| 3)} assume true; {4173#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:32,409 INFO L290 TraceCheckUtils]: 46: Hoare triple {4173#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4173#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:32,410 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4032#(<= |fibo2_#in~n| 1)} {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} #55#return; {4173#(<= |fibo1_#in~n| 3)} is VALID [2022-02-20 18:15:32,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {4032#(<= |fibo2_#in~n| 1)} assume true; {4032#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:32,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {4223#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume 1 == ~n;#res := 1; {4032#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:32,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {4223#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume !(~n < 1); {4223#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-20 18:15:32,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {3906#true} ~n := #in~n; {4223#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-20 18:15:32,411 INFO L272 TraceCheckUtils]: 40: Hoare triple {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} call #t~ret5 := fibo2(~n - 2); {3906#true} is VALID [2022-02-20 18:15:32,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-20 18:15:32,412 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3906#true} {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} #53#return; {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-20 18:15:32,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:32,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {3906#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {3906#true} is VALID [2022-02-20 18:15:32,413 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3906#true} {3906#true} #51#return; {3906#true} is VALID [2022-02-20 18:15:32,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:32,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:32,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:32,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:32,413 INFO L272 TraceCheckUtils]: 30: Hoare triple {3906#true} call #t~ret7 := fibo1(~n - 2); {3906#true} is VALID [2022-02-20 18:15:32,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {3906#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {3906#true} is VALID [2022-02-20 18:15:32,414 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3906#true} {3906#true} #49#return; {3906#true} is VALID [2022-02-20 18:15:32,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:32,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {3906#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3906#true} is VALID [2022-02-20 18:15:32,414 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3906#true} {3906#true} #55#return; {3906#true} is VALID [2022-02-20 18:15:32,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:32,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {3906#true} assume ~n < 1;#res := 0; {3906#true} is VALID [2022-02-20 18:15:32,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:32,414 INFO L272 TraceCheckUtils]: 21: Hoare triple {3906#true} call #t~ret5 := fibo2(~n - 2); {3906#true} is VALID [2022-02-20 18:15:32,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {3906#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3906#true} is VALID [2022-02-20 18:15:32,415 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3906#true} {3906#true} #53#return; {3906#true} is VALID [2022-02-20 18:15:32,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 18:15:32,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {3906#true} assume 1 == ~n;#res := 1; {3906#true} is VALID [2022-02-20 18:15:32,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:32,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:32,415 INFO L272 TraceCheckUtils]: 14: Hoare triple {3906#true} call #t~ret4 := fibo2(~n - 1); {3906#true} is VALID [2022-02-20 18:15:32,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {3906#true} assume !(1 == ~n); {3906#true} is VALID [2022-02-20 18:15:32,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:32,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:32,416 INFO L272 TraceCheckUtils]: 10: Hoare triple {3906#true} call #t~ret6 := fibo1(~n - 1); {3906#true} is VALID [2022-02-20 18:15:32,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {3906#true} assume !(1 == ~n); {3906#true} is VALID [2022-02-20 18:15:32,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {3906#true} assume !(~n < 1); {3906#true} is VALID [2022-02-20 18:15:32,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {3906#true} ~n := #in~n; {3906#true} is VALID [2022-02-20 18:15:32,416 INFO L272 TraceCheckUtils]: 6: Hoare triple {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} call #t~ret4 := fibo2(~n - 1); {3906#true} is VALID [2022-02-20 18:15:32,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} assume !(1 == ~n); {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-20 18:15:32,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} assume !(~n < 1); {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-20 18:15:32,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {3906#true} ~n := #in~n; {4213#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-20 18:15:32,418 INFO L272 TraceCheckUtils]: 2: Hoare triple {3908#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {3906#true} is VALID [2022-02-20 18:15:32,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {3908#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:32,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#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(18, 2);call #Ultimate.allocInit(12, 3); {3906#true} is VALID [2022-02-20 18:15:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-20 18:15:32,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813782469] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:32,419 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:32,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2022-02-20 18:15:32,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658860187] [2022-02-20 18:15:32,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:32,420 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Word has length 52 [2022-02-20 18:15:32,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:32,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 18:15:32,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:32,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 18:15:32,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:32,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 18:15:32,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:15:32,476 INFO L87 Difference]: Start difference. First operand 139 states and 241 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 18:15:33,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:33,109 INFO L93 Difference]: Finished difference Result 301 states and 580 transitions. [2022-02-20 18:15:33,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 18:15:33,110 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Word has length 52 [2022-02-20 18:15:33,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 18:15:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 122 transitions. [2022-02-20 18:15:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 18:15:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 122 transitions. [2022-02-20 18:15:33,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 122 transitions. [2022-02-20 18:15:33,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:33,237 INFO L225 Difference]: With dead ends: 301 [2022-02-20 18:15:33,237 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 18:15:33,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:15:33,238 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 64 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:33,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 162 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:15:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 18:15:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2022-02-20 18:15:33,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:33,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 80 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (46), 19 states have call predecessors, (46), 16 states have call successors, (46) [2022-02-20 18:15:33,277 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 80 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (46), 19 states have call predecessors, (46), 16 states have call successors, (46) [2022-02-20 18:15:33,277 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 80 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (46), 19 states have call predecessors, (46), 16 states have call successors, (46) [2022-02-20 18:15:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:33,281 INFO L93 Difference]: Finished difference Result 98 states and 153 transitions. [2022-02-20 18:15:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 153 transitions. [2022-02-20 18:15:33,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:33,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:33,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (46), 19 states have call predecessors, (46), 16 states have call successors, (46) Second operand 98 states. [2022-02-20 18:15:33,282 INFO L87 Difference]: Start difference. First operand has 80 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (46), 19 states have call predecessors, (46), 16 states have call successors, (46) Second operand 98 states. [2022-02-20 18:15:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:33,285 INFO L93 Difference]: Finished difference Result 98 states and 153 transitions. [2022-02-20 18:15:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 153 transitions. [2022-02-20 18:15:33,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:33,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:33,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:33,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (46), 19 states have call predecessors, (46), 16 states have call successors, (46) [2022-02-20 18:15:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 123 transitions. [2022-02-20 18:15:33,290 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 123 transitions. Word has length 52 [2022-02-20 18:15:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:33,290 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 123 transitions. [2022-02-20 18:15:33,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 18:15:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2022-02-20 18:15:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:15:33,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:33,292 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:33,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:33,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:33,509 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash -492645000, now seen corresponding path program 2 times [2022-02-20 18:15:33,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:33,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400455621] [2022-02-20 18:15:33,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:33,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:33,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:33,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#true} ~n := #in~n; {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {5192#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:33,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {5192#(<= |fibo2_#in~n| 1)} assume true; {5192#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:33,685 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5192#(<= |fibo2_#in~n| 1)} {5180#(= fibo1_~n |fibo1_#in~n|)} #53#return; {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:33,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {5039#true} assume ~n < 1;#res := 0; {5039#true} is VALID [2022-02-20 18:15:33,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:33,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5039#true} {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #55#return; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,692 INFO L272 TraceCheckUtils]: 3: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,692 INFO L290 TraceCheckUtils]: 4: Hoare triple {5039#true} ~n := #in~n; {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {5192#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:33,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {5192#(<= |fibo2_#in~n| 1)} assume true; {5192#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:33,693 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5192#(<= |fibo2_#in~n| 1)} {5180#(= fibo1_~n |fibo1_#in~n|)} #53#return; {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,694 INFO L272 TraceCheckUtils]: 10: Hoare triple {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {5039#true} assume ~n < 1;#res := 0; {5039#true} is VALID [2022-02-20 18:15:33,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:33,695 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5039#true} {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #55#return; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {5191#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {5191#(<= |fibo1_#in~n| 2)} assume true; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,696 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5191#(<= |fibo1_#in~n| 2)} {5154#(= fibo2_~n |fibo2_#in~n|)} #49#return; {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} is VALID [2022-02-20 18:15:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 18:15:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:33,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:33,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {5039#true} assume 1 == ~n;#res := 1; {5039#true} is VALID [2022-02-20 18:15:33,701 INFO L290 TraceCheckUtils]: 3: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:33,702 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5039#true} {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} #51#return; {5179#(<= |fibo2_#in~n| 3)} is VALID [2022-02-20 18:15:33,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#true} ~n := #in~n; {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,703 INFO L272 TraceCheckUtils]: 3: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,704 INFO L272 TraceCheckUtils]: 7: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {5039#true} ~n := #in~n; {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {5192#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:33,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {5192#(<= |fibo2_#in~n| 1)} assume true; {5192#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:33,705 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5192#(<= |fibo2_#in~n| 1)} {5180#(= fibo1_~n |fibo1_#in~n|)} #53#return; {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,706 INFO L272 TraceCheckUtils]: 14: Hoare triple {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {5039#true} assume ~n < 1;#res := 0; {5039#true} is VALID [2022-02-20 18:15:33,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:33,707 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5039#true} {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #55#return; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {5191#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {5191#(<= |fibo1_#in~n| 2)} assume true; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,708 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5191#(<= |fibo1_#in~n| 2)} {5154#(= fibo2_~n |fibo2_#in~n|)} #49#return; {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} is VALID [2022-02-20 18:15:33,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} is VALID [2022-02-20 18:15:33,708 INFO L272 TraceCheckUtils]: 23: Hoare triple {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} call #t~ret7 := fibo1(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:33,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {5039#true} assume 1 == ~n;#res := 1; {5039#true} is VALID [2022-02-20 18:15:33,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:33,709 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5039#true} {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} #51#return; {5179#(<= |fibo2_#in~n| 3)} is VALID [2022-02-20 18:15:33,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {5179#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5179#(<= |fibo2_#in~n| 3)} is VALID [2022-02-20 18:15:33,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {5179#(<= |fibo2_#in~n| 3)} assume true; {5179#(<= |fibo2_#in~n| 3)} is VALID [2022-02-20 18:15:33,710 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5179#(<= |fibo2_#in~n| 3)} {5039#true} #53#return; {5134#(<= fibo1_~n 4)} is VALID [2022-02-20 18:15:33,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-20 18:15:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:33,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:33,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {5204#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:33,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {5204#(<= |fibo1_#in~n| 1)} assume true; {5204#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:33,745 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5204#(<= |fibo1_#in~n| 1)} {5039#true} #49#return; {5198#(<= fibo2_~n 2)} is VALID [2022-02-20 18:15:33,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:33,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5205#(and (<= 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {5205#(and (<= 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume 1 == ~n;#res := 1; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {5206#(<= 1 |fibo1_#in~n|)} assume true; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,770 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5206#(<= 1 |fibo1_#in~n|)} {5198#(<= fibo2_~n 2)} #51#return; {5040#false} is VALID [2022-02-20 18:15:33,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:33,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {5039#true} assume !(1 == ~n); {5039#true} is VALID [2022-02-20 18:15:33,771 INFO L272 TraceCheckUtils]: 3: Hoare triple {5039#true} call #t~ret6 := fibo1(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {5204#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:33,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {5204#(<= |fibo1_#in~n| 1)} assume true; {5204#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:33,773 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5204#(<= |fibo1_#in~n| 1)} {5039#true} #49#return; {5198#(<= fibo2_~n 2)} is VALID [2022-02-20 18:15:33,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {5198#(<= fibo2_~n 2)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {5198#(<= fibo2_~n 2)} is VALID [2022-02-20 18:15:33,773 INFO L272 TraceCheckUtils]: 10: Hoare triple {5198#(<= fibo2_~n 2)} call #t~ret7 := fibo1(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5205#(and (<= 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {5205#(and (<= 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume 1 == ~n;#res := 1; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {5206#(<= 1 |fibo1_#in~n|)} assume true; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,775 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5206#(<= 1 |fibo1_#in~n|)} {5198#(<= fibo2_~n 2)} #51#return; {5040#false} is VALID [2022-02-20 18:15:33,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {5040#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5040#false} is VALID [2022-02-20 18:15:33,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {5040#false} assume true; {5040#false} is VALID [2022-02-20 18:15:33,775 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5040#false} {5134#(<= fibo1_~n 4)} #55#return; {5040#false} is VALID [2022-02-20 18:15:33,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:33,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {5039#true} assume !(1 == ~n); {5039#true} is VALID [2022-02-20 18:15:33,776 INFO L272 TraceCheckUtils]: 3: Hoare triple {5039#true} call #t~ret4 := fibo2(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {5039#true} ~n := #in~n; {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,776 INFO L272 TraceCheckUtils]: 7: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,777 INFO L272 TraceCheckUtils]: 11: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {5039#true} ~n := #in~n; {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {5192#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:33,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {5192#(<= |fibo2_#in~n| 1)} assume true; {5192#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:33,779 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5192#(<= |fibo2_#in~n| 1)} {5180#(= fibo1_~n |fibo1_#in~n|)} #53#return; {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,780 INFO L272 TraceCheckUtils]: 18: Hoare triple {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {5039#true} assume ~n < 1;#res := 0; {5039#true} is VALID [2022-02-20 18:15:33,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:33,781 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5039#true} {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #55#return; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {5191#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {5191#(<= |fibo1_#in~n| 2)} assume true; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,782 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5191#(<= |fibo1_#in~n| 2)} {5154#(= fibo2_~n |fibo2_#in~n|)} #49#return; {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} is VALID [2022-02-20 18:15:33,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} is VALID [2022-02-20 18:15:33,782 INFO L272 TraceCheckUtils]: 27: Hoare triple {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} call #t~ret7 := fibo1(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:33,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {5039#true} assume 1 == ~n;#res := 1; {5039#true} is VALID [2022-02-20 18:15:33,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:33,783 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5039#true} {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} #51#return; {5179#(<= |fibo2_#in~n| 3)} is VALID [2022-02-20 18:15:33,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {5179#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5179#(<= |fibo2_#in~n| 3)} is VALID [2022-02-20 18:15:33,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {5179#(<= |fibo2_#in~n| 3)} assume true; {5179#(<= |fibo2_#in~n| 3)} is VALID [2022-02-20 18:15:33,784 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5179#(<= |fibo2_#in~n| 3)} {5039#true} #53#return; {5134#(<= fibo1_~n 4)} is VALID [2022-02-20 18:15:33,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {5134#(<= fibo1_~n 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5134#(<= fibo1_~n 4)} is VALID [2022-02-20 18:15:33,785 INFO L272 TraceCheckUtils]: 37: Hoare triple {5134#(<= fibo1_~n 4)} call #t~ret5 := fibo2(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:33,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {5039#true} assume !(1 == ~n); {5039#true} is VALID [2022-02-20 18:15:33,785 INFO L272 TraceCheckUtils]: 41: Hoare triple {5039#true} call #t~ret6 := fibo1(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {5204#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:33,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {5204#(<= |fibo1_#in~n| 1)} assume true; {5204#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:33,787 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5204#(<= |fibo1_#in~n| 1)} {5039#true} #49#return; {5198#(<= fibo2_~n 2)} is VALID [2022-02-20 18:15:33,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {5198#(<= fibo2_~n 2)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {5198#(<= fibo2_~n 2)} is VALID [2022-02-20 18:15:33,787 INFO L272 TraceCheckUtils]: 48: Hoare triple {5198#(<= fibo2_~n 2)} call #t~ret7 := fibo1(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5205#(and (<= 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {5205#(and (<= 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume 1 == ~n;#res := 1; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,789 INFO L290 TraceCheckUtils]: 52: Hoare triple {5206#(<= 1 |fibo1_#in~n|)} assume true; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,789 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5206#(<= 1 |fibo1_#in~n|)} {5198#(<= fibo2_~n 2)} #51#return; {5040#false} is VALID [2022-02-20 18:15:33,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {5040#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5040#false} is VALID [2022-02-20 18:15:33,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {5040#false} assume true; {5040#false} is VALID [2022-02-20 18:15:33,789 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5040#false} {5134#(<= fibo1_~n 4)} #55#return; {5040#false} is VALID [2022-02-20 18:15:33,790 INFO L290 TraceCheckUtils]: 57: Hoare triple {5040#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5040#false} is VALID [2022-02-20 18:15:33,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {5040#false} assume true; {5040#false} is VALID [2022-02-20 18:15:33,790 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5040#false} {5041#(<= |ULTIMATE.start_main_~x~0#1| 4)} #47#return; {5040#false} is VALID [2022-02-20 18:15:33,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#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(18, 2);call #Ultimate.allocInit(12, 3); {5039#true} is VALID [2022-02-20 18:15:33,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {5039#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {5041#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 18:15:33,790 INFO L272 TraceCheckUtils]: 2: Hoare triple {5041#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5039#true} is VALID [2022-02-20 18:15:33,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:33,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {5039#true} assume !(1 == ~n); {5039#true} is VALID [2022-02-20 18:15:33,791 INFO L272 TraceCheckUtils]: 6: Hoare triple {5039#true} call #t~ret4 := fibo2(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {5039#true} ~n := #in~n; {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,792 INFO L272 TraceCheckUtils]: 10: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,793 INFO L272 TraceCheckUtils]: 14: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {5039#true} ~n := #in~n; {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {5154#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:33,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {5154#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {5192#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:33,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {5192#(<= |fibo2_#in~n| 1)} assume true; {5192#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:33,795 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5192#(<= |fibo2_#in~n| 1)} {5180#(= fibo1_~n |fibo1_#in~n|)} #53#return; {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,795 INFO L272 TraceCheckUtils]: 21: Hoare triple {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {5039#true} assume ~n < 1;#res := 0; {5039#true} is VALID [2022-02-20 18:15:33,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:33,796 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5039#true} {5186#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #55#return; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {5191#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {5191#(<= |fibo1_#in~n| 2)} assume true; {5191#(<= |fibo1_#in~n| 2)} is VALID [2022-02-20 18:15:33,797 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5191#(<= |fibo1_#in~n| 2)} {5154#(= fibo2_~n |fibo2_#in~n|)} #49#return; {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} is VALID [2022-02-20 18:15:33,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} is VALID [2022-02-20 18:15:33,798 INFO L272 TraceCheckUtils]: 30: Hoare triple {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} call #t~ret7 := fibo1(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:33,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {5039#true} assume 1 == ~n;#res := 1; {5039#true} is VALID [2022-02-20 18:15:33,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:33,799 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5039#true} {5173#(and (= fibo2_~n |fibo2_#in~n|) (<= fibo2_~n 3))} #51#return; {5179#(<= |fibo2_#in~n| 3)} is VALID [2022-02-20 18:15:33,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {5179#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5179#(<= |fibo2_#in~n| 3)} is VALID [2022-02-20 18:15:33,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {5179#(<= |fibo2_#in~n| 3)} assume true; {5179#(<= |fibo2_#in~n| 3)} is VALID [2022-02-20 18:15:33,800 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5179#(<= |fibo2_#in~n| 3)} {5039#true} #53#return; {5134#(<= fibo1_~n 4)} is VALID [2022-02-20 18:15:33,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {5134#(<= fibo1_~n 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5134#(<= fibo1_~n 4)} is VALID [2022-02-20 18:15:33,800 INFO L272 TraceCheckUtils]: 40: Hoare triple {5134#(<= fibo1_~n 4)} call #t~ret5 := fibo2(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:33,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:33,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {5039#true} assume !(1 == ~n); {5039#true} is VALID [2022-02-20 18:15:33,800 INFO L272 TraceCheckUtils]: 44: Hoare triple {5039#true} call #t~ret6 := fibo1(~n - 1); {5039#true} is VALID [2022-02-20 18:15:33,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {5204#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:33,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {5204#(<= |fibo1_#in~n| 1)} assume true; {5204#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:33,802 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5204#(<= |fibo1_#in~n| 1)} {5039#true} #49#return; {5198#(<= fibo2_~n 2)} is VALID [2022-02-20 18:15:33,802 INFO L290 TraceCheckUtils]: 50: Hoare triple {5198#(<= fibo2_~n 2)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {5198#(<= fibo2_~n 2)} is VALID [2022-02-20 18:15:33,803 INFO L272 TraceCheckUtils]: 51: Hoare triple {5198#(<= fibo2_~n 2)} call #t~ret7 := fibo1(~n - 2); {5039#true} is VALID [2022-02-20 18:15:33,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {5039#true} ~n := #in~n; {5180#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {5180#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5205#(and (<= 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-20 18:15:33,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {5205#(and (<= 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume 1 == ~n;#res := 1; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,804 INFO L290 TraceCheckUtils]: 55: Hoare triple {5206#(<= 1 |fibo1_#in~n|)} assume true; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:33,804 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5206#(<= 1 |fibo1_#in~n|)} {5198#(<= fibo2_~n 2)} #51#return; {5040#false} is VALID [2022-02-20 18:15:33,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {5040#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5040#false} is VALID [2022-02-20 18:15:33,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {5040#false} assume true; {5040#false} is VALID [2022-02-20 18:15:33,805 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5040#false} {5134#(<= fibo1_~n 4)} #55#return; {5040#false} is VALID [2022-02-20 18:15:33,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {5040#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5040#false} is VALID [2022-02-20 18:15:33,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {5040#false} assume true; {5040#false} is VALID [2022-02-20 18:15:33,805 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {5040#false} {5041#(<= |ULTIMATE.start_main_~x~0#1| 4)} #47#return; {5040#false} is VALID [2022-02-20 18:15:33,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {5040#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {5040#false} is VALID [2022-02-20 18:15:33,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {5040#false} assume 3 != main_~result~0#1; {5040#false} is VALID [2022-02-20 18:15:33,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {5040#false} assume !false; {5040#false} is VALID [2022-02-20 18:15:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 37 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-20 18:15:33,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:33,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400455621] [2022-02-20 18:15:33,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400455621] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:33,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668572146] [2022-02-20 18:15:33,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 18:15:33,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:33,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:33,807 INFO L229 MonitoredProcess]: Starting monitored process 8 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:15:33,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 18:15:33,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 18:15:33,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:15:33,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:15:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:33,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:34,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#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(18, 2);call #Ultimate.allocInit(12, 3); {5039#true} is VALID [2022-02-20 18:15:34,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {5039#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {5041#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 18:15:34,134 INFO L272 TraceCheckUtils]: 2: Hoare triple {5041#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5039#true} is VALID [2022-02-20 18:15:34,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {5039#true} ~n := #in~n; {5219#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {5219#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5219#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {5219#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,135 INFO L272 TraceCheckUtils]: 6: Hoare triple {5219#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {5039#true} is VALID [2022-02-20 18:15:34,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:34,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:34,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {5039#true} assume !(1 == ~n); {5039#true} is VALID [2022-02-20 18:15:34,135 INFO L272 TraceCheckUtils]: 10: Hoare triple {5039#true} call #t~ret6 := fibo1(~n - 1); {5039#true} is VALID [2022-02-20 18:15:34,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:34,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:34,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {5039#true} assume !(1 == ~n); {5039#true} is VALID [2022-02-20 18:15:34,136 INFO L272 TraceCheckUtils]: 14: Hoare triple {5039#true} call #t~ret4 := fibo2(~n - 1); {5039#true} is VALID [2022-02-20 18:15:34,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:34,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:34,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {5039#true} assume 1 == ~n;#res := 1; {5039#true} is VALID [2022-02-20 18:15:34,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:34,136 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5039#true} {5039#true} #53#return; {5039#true} is VALID [2022-02-20 18:15:34,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {5039#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5039#true} is VALID [2022-02-20 18:15:34,137 INFO L272 TraceCheckUtils]: 21: Hoare triple {5039#true} call #t~ret5 := fibo2(~n - 2); {5039#true} is VALID [2022-02-20 18:15:34,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:34,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {5039#true} assume ~n < 1;#res := 0; {5039#true} is VALID [2022-02-20 18:15:34,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:34,137 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5039#true} {5039#true} #55#return; {5039#true} is VALID [2022-02-20 18:15:34,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {5039#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5039#true} is VALID [2022-02-20 18:15:34,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:34,137 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5039#true} {5039#true} #49#return; {5039#true} is VALID [2022-02-20 18:15:34,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {5039#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {5039#true} is VALID [2022-02-20 18:15:34,138 INFO L272 TraceCheckUtils]: 30: Hoare triple {5039#true} call #t~ret7 := fibo1(~n - 2); {5039#true} is VALID [2022-02-20 18:15:34,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:34,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:34,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {5039#true} assume 1 == ~n;#res := 1; {5039#true} is VALID [2022-02-20 18:15:34,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:34,138 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5039#true} {5039#true} #51#return; {5039#true} is VALID [2022-02-20 18:15:34,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {5039#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5039#true} is VALID [2022-02-20 18:15:34,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:34,139 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5039#true} {5219#(<= fibo1_~n |fibo1_#in~n|)} #53#return; {5219#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {5219#(<= fibo1_~n |fibo1_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5219#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,139 INFO L272 TraceCheckUtils]: 40: Hoare triple {5219#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {5039#true} is VALID [2022-02-20 18:15:34,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {5039#true} ~n := #in~n; {5334#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:34,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {5334#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {5334#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:34,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {5334#(<= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {5334#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:34,140 INFO L272 TraceCheckUtils]: 44: Hoare triple {5334#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {5039#true} is VALID [2022-02-20 18:15:34,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:34,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:34,141 INFO L290 TraceCheckUtils]: 47: Hoare triple {5039#true} assume 1 == ~n;#res := 1; {5039#true} is VALID [2022-02-20 18:15:34,141 INFO L290 TraceCheckUtils]: 48: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:34,141 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5039#true} {5334#(<= fibo2_~n |fibo2_#in~n|)} #49#return; {5334#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:34,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {5334#(<= fibo2_~n |fibo2_#in~n|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {5334#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:34,142 INFO L272 TraceCheckUtils]: 51: Hoare triple {5334#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {5039#true} is VALID [2022-02-20 18:15:34,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {5039#true} ~n := #in~n; {5219#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {5219#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {5206#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,143 INFO L290 TraceCheckUtils]: 55: Hoare triple {5206#(<= 1 |fibo1_#in~n|)} assume true; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,144 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5206#(<= 1 |fibo1_#in~n|)} {5334#(<= fibo2_~n |fibo2_#in~n|)} #51#return; {5380#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:34,144 INFO L290 TraceCheckUtils]: 57: Hoare triple {5380#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5380#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:34,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {5380#(<= 3 |fibo2_#in~n|)} assume true; {5380#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:34,145 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5380#(<= 3 |fibo2_#in~n|)} {5219#(<= fibo1_~n |fibo1_#in~n|)} #55#return; {5390#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,146 INFO L290 TraceCheckUtils]: 60: Hoare triple {5390#(<= 5 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5390#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {5390#(<= 5 |fibo1_#in~n|)} assume true; {5390#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:34,146 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {5390#(<= 5 |fibo1_#in~n|)} {5041#(<= |ULTIMATE.start_main_~x~0#1| 4)} #47#return; {5040#false} is VALID [2022-02-20 18:15:34,147 INFO L290 TraceCheckUtils]: 63: Hoare triple {5040#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {5040#false} is VALID [2022-02-20 18:15:34,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {5040#false} assume 3 != main_~result~0#1; {5040#false} is VALID [2022-02-20 18:15:34,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {5040#false} assume !false; {5040#false} is VALID [2022-02-20 18:15:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-20 18:15:34,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:35,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {5040#false} assume !false; {5040#false} is VALID [2022-02-20 18:15:35,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {5040#false} assume 3 != main_~result~0#1; {5040#false} is VALID [2022-02-20 18:15:35,079 INFO L290 TraceCheckUtils]: 63: Hoare triple {5040#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {5040#false} is VALID [2022-02-20 18:15:35,079 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {5390#(<= 5 |fibo1_#in~n|)} {5041#(<= |ULTIMATE.start_main_~x~0#1| 4)} #47#return; {5040#false} is VALID [2022-02-20 18:15:35,080 INFO L290 TraceCheckUtils]: 61: Hoare triple {5390#(<= 5 |fibo1_#in~n|)} assume true; {5390#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:35,080 INFO L290 TraceCheckUtils]: 60: Hoare triple {5390#(<= 5 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5390#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:35,081 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5380#(<= 3 |fibo2_#in~n|)} {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} #55#return; {5390#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:35,081 INFO L290 TraceCheckUtils]: 58: Hoare triple {5380#(<= 3 |fibo2_#in~n|)} assume true; {5380#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:35,081 INFO L290 TraceCheckUtils]: 57: Hoare triple {5380#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5380#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:35,082 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5206#(<= 1 |fibo1_#in~n|)} {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} #51#return; {5380#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:35,082 INFO L290 TraceCheckUtils]: 55: Hoare triple {5206#(<= 1 |fibo1_#in~n|)} assume true; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:35,082 INFO L290 TraceCheckUtils]: 54: Hoare triple {5206#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:35,083 INFO L290 TraceCheckUtils]: 53: Hoare triple {5456#(or (< fibo1_~n 1) (<= 1 |fibo1_#in~n|))} assume !(~n < 1); {5206#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:35,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {5039#true} ~n := #in~n; {5456#(or (< fibo1_~n 1) (<= 1 |fibo1_#in~n|))} is VALID [2022-02-20 18:15:35,083 INFO L272 TraceCheckUtils]: 51: Hoare triple {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} call #t~ret7 := fibo1(~n - 2); {5039#true} is VALID [2022-02-20 18:15:35,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} is VALID [2022-02-20 18:15:35,084 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5039#true} {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} #49#return; {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} is VALID [2022-02-20 18:15:35,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:35,084 INFO L290 TraceCheckUtils]: 47: Hoare triple {5039#true} assume 1 == ~n;#res := 1; {5039#true} is VALID [2022-02-20 18:15:35,084 INFO L290 TraceCheckUtils]: 46: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:35,084 INFO L290 TraceCheckUtils]: 45: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:35,084 INFO L272 TraceCheckUtils]: 44: Hoare triple {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} call #t~ret6 := fibo1(~n - 1); {5039#true} is VALID [2022-02-20 18:15:35,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} assume !(1 == ~n); {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} is VALID [2022-02-20 18:15:35,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} assume !(~n < 1); {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} is VALID [2022-02-20 18:15:35,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {5039#true} ~n := #in~n; {5443#(or (<= 3 |fibo2_#in~n|) (< fibo2_~n 3))} is VALID [2022-02-20 18:15:35,085 INFO L272 TraceCheckUtils]: 40: Hoare triple {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} call #t~ret5 := fibo2(~n - 2); {5039#true} is VALID [2022-02-20 18:15:35,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} is VALID [2022-02-20 18:15:35,086 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5039#true} {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} #53#return; {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} is VALID [2022-02-20 18:15:35,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:35,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {5039#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5039#true} is VALID [2022-02-20 18:15:35,086 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5039#true} {5039#true} #51#return; {5039#true} is VALID [2022-02-20 18:15:35,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:35,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {5039#true} assume 1 == ~n;#res := 1; {5039#true} is VALID [2022-02-20 18:15:35,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:35,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:35,086 INFO L272 TraceCheckUtils]: 30: Hoare triple {5039#true} call #t~ret7 := fibo1(~n - 2); {5039#true} is VALID [2022-02-20 18:15:35,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {5039#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {5039#true} is VALID [2022-02-20 18:15:35,086 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5039#true} {5039#true} #49#return; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {5039#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5039#true} {5039#true} #55#return; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {5039#true} assume ~n < 1;#res := 0; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L272 TraceCheckUtils]: 21: Hoare triple {5039#true} call #t~ret5 := fibo2(~n - 2); {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {5039#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5039#true} {5039#true} #53#return; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {5039#true} assume true; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {5039#true} assume 1 == ~n;#res := 1; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L272 TraceCheckUtils]: 14: Hoare triple {5039#true} call #t~ret4 := fibo2(~n - 1); {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {5039#true} assume !(1 == ~n); {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:35,087 INFO L272 TraceCheckUtils]: 10: Hoare triple {5039#true} call #t~ret6 := fibo1(~n - 1); {5039#true} is VALID [2022-02-20 18:15:35,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {5039#true} assume !(1 == ~n); {5039#true} is VALID [2022-02-20 18:15:35,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {5039#true} assume !(~n < 1); {5039#true} is VALID [2022-02-20 18:15:35,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {5039#true} ~n := #in~n; {5039#true} is VALID [2022-02-20 18:15:35,088 INFO L272 TraceCheckUtils]: 6: Hoare triple {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} call #t~ret4 := fibo2(~n - 1); {5039#true} is VALID [2022-02-20 18:15:35,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} assume !(1 == ~n); {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} is VALID [2022-02-20 18:15:35,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} assume !(~n < 1); {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} is VALID [2022-02-20 18:15:35,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {5039#true} ~n := #in~n; {5430#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} is VALID [2022-02-20 18:15:35,089 INFO L272 TraceCheckUtils]: 2: Hoare triple {5041#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5039#true} is VALID [2022-02-20 18:15:35,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {5039#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {5041#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 18:15:35,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#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(18, 2);call #Ultimate.allocInit(12, 3); {5039#true} is VALID [2022-02-20 18:15:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-02-20 18:15:35,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668572146] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:35,090 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:35,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 22 [2022-02-20 18:15:35,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246424969] [2022-02-20 18:15:35,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:35,091 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) Word has length 66 [2022-02-20 18:15:35,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:35,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) [2022-02-20 18:15:35,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:35,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 18:15:35,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:35,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 18:15:35,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:15:35,163 INFO L87 Difference]: Start difference. First operand 80 states and 123 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) [2022-02-20 18:15:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:36,046 INFO L93 Difference]: Finished difference Result 171 states and 290 transitions. [2022-02-20 18:15:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 18:15:36,046 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) Word has length 66 [2022-02-20 18:15:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) [2022-02-20 18:15:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 144 transitions. [2022-02-20 18:15:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) [2022-02-20 18:15:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 144 transitions. [2022-02-20 18:15:36,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 144 transitions. [2022-02-20 18:15:36,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:36,161 INFO L225 Difference]: With dead ends: 171 [2022-02-20 18:15:36,161 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 18:15:36,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2022-02-20 18:15:36,163 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 72 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:36,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 222 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:15:36,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 18:15:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2022-02-20 18:15:36,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:36,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 77 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (31), 16 states have call predecessors, (31), 12 states have call successors, (31) [2022-02-20 18:15:36,193 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 77 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (31), 16 states have call predecessors, (31), 12 states have call successors, (31) [2022-02-20 18:15:36,193 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 77 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (31), 16 states have call predecessors, (31), 12 states have call successors, (31) [2022-02-20 18:15:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:36,195 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2022-02-20 18:15:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2022-02-20 18:15:36,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:36,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:36,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (31), 16 states have call predecessors, (31), 12 states have call successors, (31) Second operand 86 states. [2022-02-20 18:15:36,196 INFO L87 Difference]: Start difference. First operand has 77 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (31), 16 states have call predecessors, (31), 12 states have call successors, (31) Second operand 86 states. [2022-02-20 18:15:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:36,199 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2022-02-20 18:15:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2022-02-20 18:15:36,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:36,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:36,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:36,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (31), 16 states have call predecessors, (31), 12 states have call successors, (31) [2022-02-20 18:15:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2022-02-20 18:15:36,203 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 66 [2022-02-20 18:15:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:36,203 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2022-02-20 18:15:36,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) [2022-02-20 18:15:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2022-02-20 18:15:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:15:36,204 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:36,204 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:36,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:36,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:36,420 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:36,421 INFO L85 PathProgramCache]: Analyzing trace with hash 780870354, now seen corresponding path program 1 times [2022-02-20 18:15:36,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:36,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100848840] [2022-02-20 18:15:36,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:36,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,665 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6113#true} #53#return; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:36,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:36,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:36,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {6265#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} is VALID [2022-02-20 18:15:36,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,689 INFO L272 TraceCheckUtils]: 3: Hoare triple {6113#true} call #t~ret4 := fibo2(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,691 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6113#true} #53#return; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:36,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:36,691 INFO L272 TraceCheckUtils]: 10: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} call #t~ret5 := fibo2(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:36,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:36,693 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {6265#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} is VALID [2022-02-20 18:15:36,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {6265#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,695 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 18:15:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,705 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6253#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 2) (<= 2 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} is VALID [2022-02-20 18:15:36,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,705 INFO L272 TraceCheckUtils]: 3: Hoare triple {6113#true} call #t~ret6 := fibo1(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,706 INFO L272 TraceCheckUtils]: 7: Hoare triple {6113#true} call #t~ret4 := fibo2(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,707 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6113#true} #53#return; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:36,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:36,708 INFO L272 TraceCheckUtils]: 14: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} call #t~ret5 := fibo2(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:36,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:36,709 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {6265#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} is VALID [2022-02-20 18:15:36,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {6265#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,711 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,711 INFO L272 TraceCheckUtils]: 23: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} call #t~ret7 := fibo1(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,713 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6253#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 2) (<= 2 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} is VALID [2022-02-20 18:15:36,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {6253#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 2) (<= 2 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} assume true; {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,714 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} {6113#true} #53#return; {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} is VALID [2022-02-20 18:15:36,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-20 18:15:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,770 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:36,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} assume true; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:36,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6278#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 1) (<= 1 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} is VALID [2022-02-20 18:15:36,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,794 INFO L272 TraceCheckUtils]: 3: Hoare triple {6113#true} call #t~ret6 := fibo1(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,794 INFO L290 TraceCheckUtils]: 4: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,795 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,796 INFO L272 TraceCheckUtils]: 10: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} call #t~ret7 := fibo1(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:36,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} assume true; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:36,798 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6278#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 1) (<= 1 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} is VALID [2022-02-20 18:15:36,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {6278#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 1) (<= 1 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,799 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} #55#return; {6227#(and (<= 3 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 3))} is VALID [2022-02-20 18:15:36,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,800 INFO L272 TraceCheckUtils]: 3: Hoare triple {6113#true} call #t~ret4 := fibo2(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,800 INFO L290 TraceCheckUtils]: 4: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,800 INFO L272 TraceCheckUtils]: 7: Hoare triple {6113#true} call #t~ret6 := fibo1(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,801 INFO L272 TraceCheckUtils]: 11: Hoare triple {6113#true} call #t~ret4 := fibo2(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,803 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6113#true} #53#return; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:36,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:36,803 INFO L272 TraceCheckUtils]: 18: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} call #t~ret5 := fibo2(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:36,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:36,805 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {6265#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} is VALID [2022-02-20 18:15:36,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {6265#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,806 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,807 INFO L272 TraceCheckUtils]: 27: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} call #t~ret7 := fibo1(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,809 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6253#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 2) (<= 2 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} is VALID [2022-02-20 18:15:36,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {6253#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 2) (<= 2 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} assume true; {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,810 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} {6113#true} #53#return; {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} is VALID [2022-02-20 18:15:36,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} is VALID [2022-02-20 18:15:36,811 INFO L272 TraceCheckUtils]: 37: Hoare triple {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} call #t~ret5 := fibo2(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,811 INFO L272 TraceCheckUtils]: 41: Hoare triple {6113#true} call #t~ret6 := fibo1(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,813 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,813 INFO L272 TraceCheckUtils]: 48: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} call #t~ret7 := fibo1(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:36,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} assume true; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:36,815 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6278#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 1) (<= 1 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} is VALID [2022-02-20 18:15:36,816 INFO L290 TraceCheckUtils]: 53: Hoare triple {6278#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 1) (<= 1 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,816 INFO L290 TraceCheckUtils]: 54: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,817 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} #55#return; {6227#(and (<= 3 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 3))} is VALID [2022-02-20 18:15:36,817 INFO L290 TraceCheckUtils]: 56: Hoare triple {6227#(and (<= 3 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 3))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,818 INFO L290 TraceCheckUtils]: 57: Hoare triple {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} assume true; {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,818 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} {6113#true} #47#return; {6174#(and (<= |ULTIMATE.start_main_#t~ret8#1| 3) (<= 3 |ULTIMATE.start_main_#t~ret8#1|))} is VALID [2022-02-20 18:15:36,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#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(18, 2);call #Ultimate.allocInit(12, 3); {6113#true} is VALID [2022-02-20 18:15:36,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {6113#true} is VALID [2022-02-20 18:15:36,819 INFO L272 TraceCheckUtils]: 2: Hoare triple {6113#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {6113#true} is VALID [2022-02-20 18:15:36,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,819 INFO L272 TraceCheckUtils]: 6: Hoare triple {6113#true} call #t~ret4 := fibo2(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,820 INFO L272 TraceCheckUtils]: 10: Hoare triple {6113#true} call #t~ret6 := fibo1(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,820 INFO L272 TraceCheckUtils]: 14: Hoare triple {6113#true} call #t~ret4 := fibo2(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,822 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6113#true} #53#return; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:36,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:36,822 INFO L272 TraceCheckUtils]: 21: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} call #t~ret5 := fibo2(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:36,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:36,824 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {6265#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} is VALID [2022-02-20 18:15:36,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {6265#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,825 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,826 INFO L272 TraceCheckUtils]: 30: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} call #t~ret7 := fibo1(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,828 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6253#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 2) (<= 2 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} is VALID [2022-02-20 18:15:36,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {6253#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 2) (<= 2 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} assume true; {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,829 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} {6113#true} #53#return; {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} is VALID [2022-02-20 18:15:36,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} is VALID [2022-02-20 18:15:36,830 INFO L272 TraceCheckUtils]: 40: Hoare triple {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} call #t~ret5 := fibo2(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:36,830 INFO L272 TraceCheckUtils]: 44: Hoare triple {6113#true} call #t~ret6 := fibo1(~n - 1); {6113#true} is VALID [2022-02-20 18:15:36,830 INFO L290 TraceCheckUtils]: 45: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:36,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,832 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,832 INFO L290 TraceCheckUtils]: 50: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:36,832 INFO L272 TraceCheckUtils]: 51: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} call #t~ret7 := fibo1(~n - 2); {6113#true} is VALID [2022-02-20 18:15:36,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:36,833 INFO L290 TraceCheckUtils]: 53: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:36,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} assume true; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:36,834 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6278#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 1) (<= 1 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} is VALID [2022-02-20 18:15:36,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {6278#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 1) (<= 1 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:36,836 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} #55#return; {6227#(and (<= 3 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 3))} is VALID [2022-02-20 18:15:36,836 INFO L290 TraceCheckUtils]: 59: Hoare triple {6227#(and (<= 3 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 3))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,836 INFO L290 TraceCheckUtils]: 60: Hoare triple {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} assume true; {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} is VALID [2022-02-20 18:15:36,837 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} {6113#true} #47#return; {6174#(and (<= |ULTIMATE.start_main_#t~ret8#1| 3) (<= 3 |ULTIMATE.start_main_#t~ret8#1|))} is VALID [2022-02-20 18:15:36,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {6174#(and (<= |ULTIMATE.start_main_#t~ret8#1| 3) (<= 3 |ULTIMATE.start_main_#t~ret8#1|))} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {6175#(and (< 2 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 3))} is VALID [2022-02-20 18:15:36,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {6175#(and (< 2 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 3))} assume 3 != main_~result~0#1; {6114#false} is VALID [2022-02-20 18:15:36,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {6114#false} assume !false; {6114#false} is VALID [2022-02-20 18:15:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-02-20 18:15:36,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:36,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100848840] [2022-02-20 18:15:36,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100848840] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:36,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706683813] [2022-02-20 18:15:36,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:36,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:36,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:36,841 INFO L229 MonitoredProcess]: Starting monitored process 9 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:15:36,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 18:15:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-20 18:15:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:36,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:37,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#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(18, 2);call #Ultimate.allocInit(12, 3); {6113#true} is VALID [2022-02-20 18:15:37,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {6113#true} is VALID [2022-02-20 18:15:37,524 INFO L272 TraceCheckUtils]: 2: Hoare triple {6113#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {6113#true} is VALID [2022-02-20 18:15:37,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:37,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:37,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:37,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {6113#true} call #t~ret4 := fibo2(~n - 1); {6113#true} is VALID [2022-02-20 18:15:37,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:37,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:37,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:37,525 INFO L272 TraceCheckUtils]: 10: Hoare triple {6113#true} call #t~ret6 := fibo1(~n - 1); {6113#true} is VALID [2022-02-20 18:15:37,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:37,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:37,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:37,525 INFO L272 TraceCheckUtils]: 14: Hoare triple {6113#true} call #t~ret4 := fibo2(~n - 1); {6113#true} is VALID [2022-02-20 18:15:37,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:37,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:37,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:37,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:37,527 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6113#true} #53#return; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:37,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:37,527 INFO L272 TraceCheckUtils]: 21: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} call #t~ret5 := fibo2(~n - 2); {6113#true} is VALID [2022-02-20 18:15:37,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:37,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:37,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:37,529 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {6358#(and (<= |fibo1_#t~ret5| 0) (<= 1 |fibo1_#t~ret4|) (<= 0 |fibo1_#t~ret5|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:37,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {6358#(and (<= |fibo1_#t~ret5| 0) (<= 1 |fibo1_#t~ret4|) (<= 0 |fibo1_#t~ret5|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:37,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:37,530 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:37,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:37,531 INFO L272 TraceCheckUtils]: 30: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} call #t~ret7 := fibo1(~n - 2); {6113#true} is VALID [2022-02-20 18:15:37,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:37,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:37,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:37,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:37,532 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6389#(and (<= |fibo2_#t~ret7| 1) (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|) (<= 1 |fibo2_#t~ret7|))} is VALID [2022-02-20 18:15:37,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {6389#(and (<= |fibo2_#t~ret7| 1) (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|) (<= 1 |fibo2_#t~ret7|))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} is VALID [2022-02-20 18:15:37,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} assume true; {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} is VALID [2022-02-20 18:15:37,534 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} {6113#true} #53#return; {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} is VALID [2022-02-20 18:15:37,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} is VALID [2022-02-20 18:15:37,534 INFO L272 TraceCheckUtils]: 40: Hoare triple {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} call #t~ret5 := fibo2(~n - 2); {6113#true} is VALID [2022-02-20 18:15:37,534 INFO L290 TraceCheckUtils]: 41: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:37,534 INFO L290 TraceCheckUtils]: 42: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:37,534 INFO L290 TraceCheckUtils]: 43: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:37,535 INFO L272 TraceCheckUtils]: 44: Hoare triple {6113#true} call #t~ret6 := fibo1(~n - 1); {6113#true} is VALID [2022-02-20 18:15:37,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:37,535 INFO L290 TraceCheckUtils]: 46: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:37,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:37,535 INFO L290 TraceCheckUtils]: 48: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:37,536 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:37,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:37,536 INFO L272 TraceCheckUtils]: 51: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} call #t~ret7 := fibo1(~n - 2); {6113#true} is VALID [2022-02-20 18:15:37,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:37,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:37,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} assume true; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:37,538 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6450#(and (<= 0 |fibo2_#t~ret7|) (<= |fibo2_#t~ret7| 0) (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:37,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {6450#(and (<= 0 |fibo2_#t~ret7|) (<= |fibo2_#t~ret7| 0) (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:37,539 INFO L290 TraceCheckUtils]: 57: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:37,539 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} #55#return; {6460#(and (<= |fibo1_#t~ret5| 1) (<= 1 |fibo1_#t~ret5|) (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} is VALID [2022-02-20 18:15:37,540 INFO L290 TraceCheckUtils]: 59: Hoare triple {6460#(and (<= |fibo1_#t~ret5| 1) (<= 1 |fibo1_#t~ret5|) (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} is VALID [2022-02-20 18:15:37,540 INFO L290 TraceCheckUtils]: 60: Hoare triple {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} assume true; {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} is VALID [2022-02-20 18:15:37,541 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} {6113#true} #47#return; {6174#(and (<= |ULTIMATE.start_main_#t~ret8#1| 3) (<= 3 |ULTIMATE.start_main_#t~ret8#1|))} is VALID [2022-02-20 18:15:37,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {6174#(and (<= |ULTIMATE.start_main_#t~ret8#1| 3) (<= 3 |ULTIMATE.start_main_#t~ret8#1|))} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {6175#(and (< 2 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 3))} is VALID [2022-02-20 18:15:37,542 INFO L290 TraceCheckUtils]: 63: Hoare triple {6175#(and (< 2 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 3))} assume 3 != main_~result~0#1; {6114#false} is VALID [2022-02-20 18:15:37,542 INFO L290 TraceCheckUtils]: 64: Hoare triple {6114#false} assume !false; {6114#false} is VALID [2022-02-20 18:15:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-02-20 18:15:37,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:38,539 INFO L290 TraceCheckUtils]: 64: Hoare triple {6114#false} assume !false; {6114#false} is VALID [2022-02-20 18:15:38,540 INFO L290 TraceCheckUtils]: 63: Hoare triple {6175#(and (< 2 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 3))} assume 3 != main_~result~0#1; {6114#false} is VALID [2022-02-20 18:15:38,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {6174#(and (<= |ULTIMATE.start_main_#t~ret8#1| 3) (<= 3 |ULTIMATE.start_main_#t~ret8#1|))} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {6175#(and (< 2 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 3))} is VALID [2022-02-20 18:15:38,541 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} {6113#true} #47#return; {6174#(and (<= |ULTIMATE.start_main_#t~ret8#1| 3) (<= 3 |ULTIMATE.start_main_#t~ret8#1|))} is VALID [2022-02-20 18:15:38,542 INFO L290 TraceCheckUtils]: 60: Hoare triple {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} assume true; {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} is VALID [2022-02-20 18:15:38,542 INFO L290 TraceCheckUtils]: 59: Hoare triple {6227#(and (<= 3 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 3))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6228#(and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))} is VALID [2022-02-20 18:15:38,543 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} #55#return; {6227#(and (<= 3 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 3))} is VALID [2022-02-20 18:15:38,543 INFO L290 TraceCheckUtils]: 57: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:38,544 INFO L290 TraceCheckUtils]: 56: Hoare triple {6278#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 1) (<= 1 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:38,545 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6278#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 1) (<= 1 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} is VALID [2022-02-20 18:15:38,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} assume true; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:38,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6279#(and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0))} is VALID [2022-02-20 18:15:38,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:38,546 INFO L272 TraceCheckUtils]: 51: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} call #t~ret7 := fibo1(~n - 2); {6113#true} is VALID [2022-02-20 18:15:38,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:38,547 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:38,547 INFO L290 TraceCheckUtils]: 48: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:38,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:38,547 INFO L290 TraceCheckUtils]: 46: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:38,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:38,548 INFO L272 TraceCheckUtils]: 44: Hoare triple {6113#true} call #t~ret6 := fibo1(~n - 1); {6113#true} is VALID [2022-02-20 18:15:38,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:38,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:38,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:38,548 INFO L272 TraceCheckUtils]: 40: Hoare triple {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} call #t~ret5 := fibo2(~n - 2); {6113#true} is VALID [2022-02-20 18:15:38,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} is VALID [2022-02-20 18:15:38,549 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} {6113#true} #53#return; {6208#(and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))} is VALID [2022-02-20 18:15:38,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} assume true; {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} is VALID [2022-02-20 18:15:38,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {6253#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 2) (<= 2 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6254#(and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|))} is VALID [2022-02-20 18:15:38,551 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} #51#return; {6253#(and (<= (+ |fibo2_#t~ret7| |fibo2_#t~ret6|) 2) (<= 2 (+ |fibo2_#t~ret7| |fibo2_#t~ret6|)))} is VALID [2022-02-20 18:15:38,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:38,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:38,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:38,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:38,552 INFO L272 TraceCheckUtils]: 30: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} call #t~ret7 := fibo1(~n - 2); {6113#true} is VALID [2022-02-20 18:15:38,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:38,553 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {6113#true} #49#return; {6247#(and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|))} is VALID [2022-02-20 18:15:38,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:38,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {6265#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6266#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:38,555 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {6265#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} is VALID [2022-02-20 18:15:38,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:38,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {6113#true} assume ~n < 1;#res := 0; {6268#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:38,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:38,556 INFO L272 TraceCheckUtils]: 21: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} call #t~ret5 := fibo2(~n - 2); {6113#true} is VALID [2022-02-20 18:15:38,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:38,557 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {6113#true} #53#return; {6260#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:38,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:38,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {6113#true} assume 1 == ~n;#res := 1; {6267#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:38,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:38,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:38,558 INFO L272 TraceCheckUtils]: 14: Hoare triple {6113#true} call #t~ret4 := fibo2(~n - 1); {6113#true} is VALID [2022-02-20 18:15:38,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:38,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:38,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:38,558 INFO L272 TraceCheckUtils]: 10: Hoare triple {6113#true} call #t~ret6 := fibo1(~n - 1); {6113#true} is VALID [2022-02-20 18:15:38,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:38,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:38,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:38,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {6113#true} call #t~ret4 := fibo2(~n - 1); {6113#true} is VALID [2022-02-20 18:15:38,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {6113#true} assume !(1 == ~n); {6113#true} is VALID [2022-02-20 18:15:38,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {6113#true} assume !(~n < 1); {6113#true} is VALID [2022-02-20 18:15:38,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {6113#true} ~n := #in~n; {6113#true} is VALID [2022-02-20 18:15:38,559 INFO L272 TraceCheckUtils]: 2: Hoare triple {6113#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {6113#true} is VALID [2022-02-20 18:15:38,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {6113#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {6113#true} is VALID [2022-02-20 18:15:38,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#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(18, 2);call #Ultimate.allocInit(12, 3); {6113#true} is VALID [2022-02-20 18:15:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-02-20 18:15:38,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706683813] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:38,560 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:38,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2022-02-20 18:15:38,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783180465] [2022-02-20 18:15:38,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:38,561 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) Word has length 65 [2022-02-20 18:15:38,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:38,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:15:38,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:38,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 18:15:38,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 18:15:38,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:15:38,602 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:15:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:39,155 INFO L93 Difference]: Finished difference Result 94 states and 128 transitions. [2022-02-20 18:15:39,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 18:15:39,155 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) Word has length 65 [2022-02-20 18:15:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:15:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-02-20 18:15:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:15:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-02-20 18:15:39,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 65 transitions. [2022-02-20 18:15:39,243 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:15:39,244 INFO L225 Difference]: With dead ends: 94 [2022-02-20 18:15:39,244 INFO L226 Difference]: Without dead ends: 90 [2022-02-20 18:15:39,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 140 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:15:39,245 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:39,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 613 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:15:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-20 18:15:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-02-20 18:15:39,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:39,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 87 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (38), 20 states have call predecessors, (38), 14 states have call successors, (38) [2022-02-20 18:15:39,303 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 87 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (38), 20 states have call predecessors, (38), 14 states have call successors, (38) [2022-02-20 18:15:39,304 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 87 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (38), 20 states have call predecessors, (38), 14 states have call successors, (38) [2022-02-20 18:15:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:39,306 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-02-20 18:15:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-02-20 18:15:39,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:39,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:39,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (38), 20 states have call predecessors, (38), 14 states have call successors, (38) Second operand 90 states. [2022-02-20 18:15:39,307 INFO L87 Difference]: Start difference. First operand has 87 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (38), 20 states have call predecessors, (38), 14 states have call successors, (38) Second operand 90 states. [2022-02-20 18:15:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:39,309 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-02-20 18:15:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-02-20 18:15:39,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:39,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:39,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:39,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (38), 20 states have call predecessors, (38), 14 states have call successors, (38) [2022-02-20 18:15:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2022-02-20 18:15:39,314 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 65 [2022-02-20 18:15:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:39,314 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2022-02-20 18:15:39,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:15:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2022-02-20 18:15:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:15:39,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:39,315 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:39,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:39,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 18:15:39,535 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:39,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:39,535 INFO L85 PathProgramCache]: Analyzing trace with hash -788749532, now seen corresponding path program 1 times [2022-02-20 18:15:39,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:39,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618545862] [2022-02-20 18:15:39,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:39,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#true} ~n := #in~n; {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7225#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:39,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {7225#(<= |fibo2_#in~n| 1)} assume true; {7225#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:39,697 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7225#(<= |fibo2_#in~n| 1)} {7075#true} #53#return; {7218#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:39,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#true} ~n := #in~n; {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7226#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2022-02-20 18:15:39,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {7226#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume 1 == ~n;#res := 1; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {7227#(<= 1 |fibo2_#in~n|)} assume true; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,736 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7227#(<= 1 |fibo2_#in~n|)} {7218#(<= fibo1_~n 2)} #55#return; {7076#false} is VALID [2022-02-20 18:15:39,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,737 INFO L272 TraceCheckUtils]: 3: Hoare triple {7075#true} call #t~ret4 := fibo2(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {7075#true} ~n := #in~n; {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7225#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:39,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {7225#(<= |fibo2_#in~n| 1)} assume true; {7225#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:39,739 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {7225#(<= |fibo2_#in~n| 1)} {7075#true} #53#return; {7218#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:39,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {7218#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7218#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:39,739 INFO L272 TraceCheckUtils]: 10: Hoare triple {7218#(<= fibo1_~n 2)} call #t~ret5 := fibo2(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {7075#true} ~n := #in~n; {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7226#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2022-02-20 18:15:39,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {7226#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume 1 == ~n;#res := 1; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {7227#(<= 1 |fibo2_#in~n|)} assume true; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,741 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7227#(<= 1 |fibo2_#in~n|)} {7218#(<= fibo1_~n 2)} #55#return; {7076#false} is VALID [2022-02-20 18:15:39,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {7076#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7076#false} is VALID [2022-02-20 18:15:39,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {7076#false} assume true; {7076#false} is VALID [2022-02-20 18:15:39,741 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7076#false} {7075#true} #49#return; {7076#false} is VALID [2022-02-20 18:15:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 18:15:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:39,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,746 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7075#true} {7076#false} #51#return; {7076#false} is VALID [2022-02-20 18:15:39,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,746 INFO L272 TraceCheckUtils]: 3: Hoare triple {7075#true} call #t~ret6 := fibo1(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,747 INFO L272 TraceCheckUtils]: 7: Hoare triple {7075#true} call #t~ret4 := fibo2(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {7075#true} ~n := #in~n; {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7225#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:39,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {7225#(<= |fibo2_#in~n| 1)} assume true; {7225#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:39,765 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7225#(<= |fibo2_#in~n| 1)} {7075#true} #53#return; {7218#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:39,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {7218#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7218#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:39,765 INFO L272 TraceCheckUtils]: 14: Hoare triple {7218#(<= fibo1_~n 2)} call #t~ret5 := fibo2(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {7075#true} ~n := #in~n; {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7226#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2022-02-20 18:15:39,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {7226#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume 1 == ~n;#res := 1; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {7227#(<= 1 |fibo2_#in~n|)} assume true; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,767 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7227#(<= 1 |fibo2_#in~n|)} {7218#(<= fibo1_~n 2)} #55#return; {7076#false} is VALID [2022-02-20 18:15:39,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {7076#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7076#false} is VALID [2022-02-20 18:15:39,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {7076#false} assume true; {7076#false} is VALID [2022-02-20 18:15:39,767 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7076#false} {7075#true} #49#return; {7076#false} is VALID [2022-02-20 18:15:39,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {7076#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {7076#false} is VALID [2022-02-20 18:15:39,768 INFO L272 TraceCheckUtils]: 24: Hoare triple {7076#false} call #t~ret7 := fibo1(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:39,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,768 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7075#true} {7076#false} #51#return; {7076#false} is VALID [2022-02-20 18:15:39,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {7076#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7076#false} is VALID [2022-02-20 18:15:39,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {7076#false} assume true; {7076#false} is VALID [2022-02-20 18:15:39,768 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7076#false} {7075#true} #53#return; {7076#false} is VALID [2022-02-20 18:15:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:15:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:39,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,779 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7075#true} {7075#true} #49#return; {7075#true} is VALID [2022-02-20 18:15:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {7075#true} assume ~n < 1;#res := 0; {7075#true} is VALID [2022-02-20 18:15:39,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7075#true} {7075#true} #51#return; {7075#true} is VALID [2022-02-20 18:15:39,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,785 INFO L272 TraceCheckUtils]: 3: Hoare triple {7075#true} call #t~ret6 := fibo1(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:39,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,786 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {7075#true} {7075#true} #49#return; {7075#true} is VALID [2022-02-20 18:15:39,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {7075#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {7075#true} is VALID [2022-02-20 18:15:39,786 INFO L272 TraceCheckUtils]: 10: Hoare triple {7075#true} call #t~ret7 := fibo1(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {7075#true} assume ~n < 1;#res := 0; {7075#true} is VALID [2022-02-20 18:15:39,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,786 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7075#true} {7075#true} #51#return; {7075#true} is VALID [2022-02-20 18:15:39,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {7075#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7075#true} is VALID [2022-02-20 18:15:39,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,787 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7075#true} {7076#false} #55#return; {7076#false} is VALID [2022-02-20 18:15:39,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,787 INFO L272 TraceCheckUtils]: 3: Hoare triple {7075#true} call #t~ret4 := fibo2(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,788 INFO L272 TraceCheckUtils]: 7: Hoare triple {7075#true} call #t~ret6 := fibo1(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,788 INFO L272 TraceCheckUtils]: 11: Hoare triple {7075#true} call #t~ret4 := fibo2(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {7075#true} ~n := #in~n; {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7225#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:39,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {7225#(<= |fibo2_#in~n| 1)} assume true; {7225#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:39,804 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7225#(<= |fibo2_#in~n| 1)} {7075#true} #53#return; {7218#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:39,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {7218#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7218#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:39,805 INFO L272 TraceCheckUtils]: 18: Hoare triple {7218#(<= fibo1_~n 2)} call #t~ret5 := fibo2(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {7075#true} ~n := #in~n; {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7226#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2022-02-20 18:15:39,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {7226#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume 1 == ~n;#res := 1; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {7227#(<= 1 |fibo2_#in~n|)} assume true; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,807 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7227#(<= 1 |fibo2_#in~n|)} {7218#(<= fibo1_~n 2)} #55#return; {7076#false} is VALID [2022-02-20 18:15:39,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {7076#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7076#false} is VALID [2022-02-20 18:15:39,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {7076#false} assume true; {7076#false} is VALID [2022-02-20 18:15:39,807 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7076#false} {7075#true} #49#return; {7076#false} is VALID [2022-02-20 18:15:39,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {7076#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {7076#false} is VALID [2022-02-20 18:15:39,807 INFO L272 TraceCheckUtils]: 28: Hoare triple {7076#false} call #t~ret7 := fibo1(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:39,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,808 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7075#true} {7076#false} #51#return; {7076#false} is VALID [2022-02-20 18:15:39,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {7076#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7076#false} is VALID [2022-02-20 18:15:39,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {7076#false} assume true; {7076#false} is VALID [2022-02-20 18:15:39,808 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7076#false} {7075#true} #53#return; {7076#false} is VALID [2022-02-20 18:15:39,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {7076#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7076#false} is VALID [2022-02-20 18:15:39,808 INFO L272 TraceCheckUtils]: 38: Hoare triple {7076#false} call #t~ret5 := fibo2(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,809 INFO L272 TraceCheckUtils]: 42: Hoare triple {7075#true} call #t~ret6 := fibo1(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,809 INFO L290 TraceCheckUtils]: 43: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,809 INFO L290 TraceCheckUtils]: 45: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:39,809 INFO L290 TraceCheckUtils]: 46: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,809 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7075#true} {7075#true} #49#return; {7075#true} is VALID [2022-02-20 18:15:39,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {7075#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {7075#true} is VALID [2022-02-20 18:15:39,809 INFO L272 TraceCheckUtils]: 49: Hoare triple {7075#true} call #t~ret7 := fibo1(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {7075#true} assume ~n < 1;#res := 0; {7075#true} is VALID [2022-02-20 18:15:39,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,810 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {7075#true} {7075#true} #51#return; {7075#true} is VALID [2022-02-20 18:15:39,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {7075#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7075#true} is VALID [2022-02-20 18:15:39,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,810 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7075#true} {7076#false} #55#return; {7076#false} is VALID [2022-02-20 18:15:39,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {7076#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7076#false} is VALID [2022-02-20 18:15:39,810 INFO L290 TraceCheckUtils]: 58: Hoare triple {7076#false} assume true; {7076#false} is VALID [2022-02-20 18:15:39,810 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7076#false} {7077#(<= |ULTIMATE.start_main_~x~0#1| 4)} #47#return; {7076#false} is VALID [2022-02-20 18:15:39,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#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(18, 2);call #Ultimate.allocInit(12, 3); {7075#true} is VALID [2022-02-20 18:15:39,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {7075#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {7077#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 18:15:39,811 INFO L272 TraceCheckUtils]: 2: Hoare triple {7077#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {7075#true} is VALID [2022-02-20 18:15:39,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {7075#true} call #t~ret4 := fibo2(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,812 INFO L272 TraceCheckUtils]: 10: Hoare triple {7075#true} call #t~ret6 := fibo1(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,812 INFO L272 TraceCheckUtils]: 14: Hoare triple {7075#true} call #t~ret4 := fibo2(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {7075#true} ~n := #in~n; {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7225#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:39,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {7225#(<= |fibo2_#in~n| 1)} assume true; {7225#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:39,814 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7225#(<= |fibo2_#in~n| 1)} {7075#true} #53#return; {7218#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:39,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {7218#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7218#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:39,815 INFO L272 TraceCheckUtils]: 21: Hoare triple {7218#(<= fibo1_~n 2)} call #t~ret5 := fibo2(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {7075#true} ~n := #in~n; {7224#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {7224#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7226#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2022-02-20 18:15:39,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {7226#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume 1 == ~n;#res := 1; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {7227#(<= 1 |fibo2_#in~n|)} assume true; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:39,816 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7227#(<= 1 |fibo2_#in~n|)} {7218#(<= fibo1_~n 2)} #55#return; {7076#false} is VALID [2022-02-20 18:15:39,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {7076#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7076#false} is VALID [2022-02-20 18:15:39,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {7076#false} assume true; {7076#false} is VALID [2022-02-20 18:15:39,817 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7076#false} {7075#true} #49#return; {7076#false} is VALID [2022-02-20 18:15:39,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {7076#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {7076#false} is VALID [2022-02-20 18:15:39,817 INFO L272 TraceCheckUtils]: 31: Hoare triple {7076#false} call #t~ret7 := fibo1(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:39,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,817 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7075#true} {7076#false} #51#return; {7076#false} is VALID [2022-02-20 18:15:39,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {7076#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7076#false} is VALID [2022-02-20 18:15:39,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {7076#false} assume true; {7076#false} is VALID [2022-02-20 18:15:39,818 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7076#false} {7075#true} #53#return; {7076#false} is VALID [2022-02-20 18:15:39,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {7076#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7076#false} is VALID [2022-02-20 18:15:39,818 INFO L272 TraceCheckUtils]: 41: Hoare triple {7076#false} call #t~ret5 := fibo2(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:39,818 INFO L272 TraceCheckUtils]: 45: Hoare triple {7075#true} call #t~ret6 := fibo1(~n - 1); {7075#true} is VALID [2022-02-20 18:15:39,818 INFO L290 TraceCheckUtils]: 46: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:39,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:39,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,819 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7075#true} {7075#true} #49#return; {7075#true} is VALID [2022-02-20 18:15:39,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {7075#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {7075#true} is VALID [2022-02-20 18:15:39,819 INFO L272 TraceCheckUtils]: 52: Hoare triple {7075#true} call #t~ret7 := fibo1(~n - 2); {7075#true} is VALID [2022-02-20 18:15:39,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:39,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {7075#true} assume ~n < 1;#res := 0; {7075#true} is VALID [2022-02-20 18:15:39,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,819 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7075#true} {7075#true} #51#return; {7075#true} is VALID [2022-02-20 18:15:39,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {7075#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7075#true} is VALID [2022-02-20 18:15:39,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:39,820 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7075#true} {7076#false} #55#return; {7076#false} is VALID [2022-02-20 18:15:39,820 INFO L290 TraceCheckUtils]: 60: Hoare triple {7076#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7076#false} is VALID [2022-02-20 18:15:39,820 INFO L290 TraceCheckUtils]: 61: Hoare triple {7076#false} assume true; {7076#false} is VALID [2022-02-20 18:15:39,820 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7076#false} {7077#(<= |ULTIMATE.start_main_~x~0#1| 4)} #47#return; {7076#false} is VALID [2022-02-20 18:15:39,820 INFO L290 TraceCheckUtils]: 63: Hoare triple {7076#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {7076#false} is VALID [2022-02-20 18:15:39,820 INFO L290 TraceCheckUtils]: 64: Hoare triple {7076#false} assume 3 != main_~result~0#1; {7076#false} is VALID [2022-02-20 18:15:39,820 INFO L290 TraceCheckUtils]: 65: Hoare triple {7076#false} assume !false; {7076#false} is VALID [2022-02-20 18:15:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-02-20 18:15:39,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:39,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618545862] [2022-02-20 18:15:39,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618545862] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:39,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805252924] [2022-02-20 18:15:39,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:39,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:39,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:39,835 INFO L229 MonitoredProcess]: Starting monitored process 10 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:15:39,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 18:15:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 18:15:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:39,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:40,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#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(18, 2);call #Ultimate.allocInit(12, 3); {7075#true} is VALID [2022-02-20 18:15:40,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {7075#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {7077#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 18:15:40,332 INFO L272 TraceCheckUtils]: 2: Hoare triple {7077#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {7075#true} is VALID [2022-02-20 18:15:40,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {7075#true} ~n := #in~n; {7249#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {7249#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {7249#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {7249#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {7249#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {7249#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {7075#true} is VALID [2022-02-20 18:15:40,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {7075#true} ~n := #in~n; {7262#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {7262#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7262#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {7262#(<= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {7262#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,334 INFO L272 TraceCheckUtils]: 10: Hoare triple {7262#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {7075#true} is VALID [2022-02-20 18:15:40,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {7075#true} ~n := #in~n; {7249#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {7249#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {7249#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {7249#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {7249#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,335 INFO L272 TraceCheckUtils]: 14: Hoare triple {7249#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {7075#true} is VALID [2022-02-20 18:15:40,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:40,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:40,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:40,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:40,336 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7075#true} {7249#(<= fibo1_~n |fibo1_#in~n|)} #53#return; {7249#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {7249#(<= fibo1_~n |fibo1_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7249#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,337 INFO L272 TraceCheckUtils]: 21: Hoare triple {7249#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {7075#true} is VALID [2022-02-20 18:15:40,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {7075#true} ~n := #in~n; {7262#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {7262#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {7227#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {7227#(<= 1 |fibo2_#in~n|)} assume true; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,339 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7227#(<= 1 |fibo2_#in~n|)} {7249#(<= fibo1_~n |fibo1_#in~n|)} #55#return; {7320#(<= 3 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {7320#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7320#(<= 3 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {7320#(<= 3 |fibo1_#in~n|)} assume true; {7320#(<= 3 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,340 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7320#(<= 3 |fibo1_#in~n|)} {7262#(<= fibo2_~n |fibo2_#in~n|)} #49#return; {7330#(<= 4 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {7330#(<= 4 |fibo2_#in~n|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {7330#(<= 4 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,340 INFO L272 TraceCheckUtils]: 31: Hoare triple {7330#(<= 4 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {7075#true} is VALID [2022-02-20 18:15:40,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:40,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:40,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:40,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:40,341 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7075#true} {7330#(<= 4 |fibo2_#in~n|)} #51#return; {7330#(<= 4 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {7330#(<= 4 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7330#(<= 4 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {7330#(<= 4 |fibo2_#in~n|)} assume true; {7330#(<= 4 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:40,342 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7330#(<= 4 |fibo2_#in~n|)} {7249#(<= fibo1_~n |fibo1_#in~n|)} #53#return; {7361#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {7361#(<= 5 |fibo1_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7361#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,343 INFO L272 TraceCheckUtils]: 41: Hoare triple {7361#(<= 5 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {7075#true} is VALID [2022-02-20 18:15:40,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:40,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:40,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:40,343 INFO L272 TraceCheckUtils]: 45: Hoare triple {7075#true} call #t~ret6 := fibo1(~n - 1); {7075#true} is VALID [2022-02-20 18:15:40,343 INFO L290 TraceCheckUtils]: 46: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:40,344 INFO L290 TraceCheckUtils]: 47: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:40,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:40,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:40,344 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7075#true} {7075#true} #49#return; {7075#true} is VALID [2022-02-20 18:15:40,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {7075#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {7075#true} is VALID [2022-02-20 18:15:40,359 INFO L272 TraceCheckUtils]: 52: Hoare triple {7075#true} call #t~ret7 := fibo1(~n - 2); {7075#true} is VALID [2022-02-20 18:15:40,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:40,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {7075#true} assume ~n < 1;#res := 0; {7075#true} is VALID [2022-02-20 18:15:40,360 INFO L290 TraceCheckUtils]: 55: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:40,360 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7075#true} {7075#true} #51#return; {7075#true} is VALID [2022-02-20 18:15:40,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {7075#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7075#true} is VALID [2022-02-20 18:15:40,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:40,361 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7075#true} {7361#(<= 5 |fibo1_#in~n|)} #55#return; {7361#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,361 INFO L290 TraceCheckUtils]: 60: Hoare triple {7361#(<= 5 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7361#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {7361#(<= 5 |fibo1_#in~n|)} assume true; {7361#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:40,362 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7361#(<= 5 |fibo1_#in~n|)} {7077#(<= |ULTIMATE.start_main_~x~0#1| 4)} #47#return; {7076#false} is VALID [2022-02-20 18:15:40,362 INFO L290 TraceCheckUtils]: 63: Hoare triple {7076#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {7076#false} is VALID [2022-02-20 18:15:40,362 INFO L290 TraceCheckUtils]: 64: Hoare triple {7076#false} assume 3 != main_~result~0#1; {7076#false} is VALID [2022-02-20 18:15:40,362 INFO L290 TraceCheckUtils]: 65: Hoare triple {7076#false} assume !false; {7076#false} is VALID [2022-02-20 18:15:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-02-20 18:15:40,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:41,895 INFO L290 TraceCheckUtils]: 65: Hoare triple {7076#false} assume !false; {7076#false} is VALID [2022-02-20 18:15:41,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {7076#false} assume 3 != main_~result~0#1; {7076#false} is VALID [2022-02-20 18:15:41,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {7076#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {7076#false} is VALID [2022-02-20 18:15:41,896 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7361#(<= 5 |fibo1_#in~n|)} {7077#(<= |ULTIMATE.start_main_~x~0#1| 4)} #47#return; {7076#false} is VALID [2022-02-20 18:15:41,897 INFO L290 TraceCheckUtils]: 61: Hoare triple {7361#(<= 5 |fibo1_#in~n|)} assume true; {7361#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:41,897 INFO L290 TraceCheckUtils]: 60: Hoare triple {7361#(<= 5 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7361#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:41,898 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7075#true} {7361#(<= 5 |fibo1_#in~n|)} #55#return; {7361#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 58: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {7075#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7075#true} {7075#true} #51#return; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {7075#true} assume ~n < 1;#res := 0; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L272 TraceCheckUtils]: 52: Hoare triple {7075#true} call #t~ret7 := fibo1(~n - 2); {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 51: Hoare triple {7075#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7075#true} {7075#true} #49#return; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 48: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L272 TraceCheckUtils]: 45: Hoare triple {7075#true} call #t~ret6 := fibo1(~n - 1); {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {7075#true} assume !(1 == ~n); {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:41,898 INFO L272 TraceCheckUtils]: 41: Hoare triple {7361#(<= 5 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {7075#true} is VALID [2022-02-20 18:15:41,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {7361#(<= 5 |fibo1_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7361#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:41,900 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7330#(<= 4 |fibo2_#in~n|)} {7521#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} #53#return; {7361#(<= 5 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:41,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {7330#(<= 4 |fibo2_#in~n|)} assume true; {7330#(<= 4 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:41,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {7330#(<= 4 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7330#(<= 4 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:41,901 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7075#true} {7330#(<= 4 |fibo2_#in~n|)} #51#return; {7330#(<= 4 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:41,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:41,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:41,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:41,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:41,901 INFO L272 TraceCheckUtils]: 31: Hoare triple {7330#(<= 4 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {7075#true} is VALID [2022-02-20 18:15:41,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {7330#(<= 4 |fibo2_#in~n|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {7330#(<= 4 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:41,902 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7320#(<= 3 |fibo1_#in~n|)} {7555#(or (<= 4 |fibo2_#in~n|) (< fibo2_~n 4))} #49#return; {7330#(<= 4 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:41,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {7320#(<= 3 |fibo1_#in~n|)} assume true; {7320#(<= 3 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:41,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {7320#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7320#(<= 3 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:41,904 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7227#(<= 1 |fibo2_#in~n|)} {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} #55#return; {7320#(<= 3 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:41,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {7227#(<= 1 |fibo2_#in~n|)} assume true; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:41,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {7227#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:41,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {7581#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} assume !(~n < 1); {7227#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:41,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {7075#true} ~n := #in~n; {7581#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} is VALID [2022-02-20 18:15:41,905 INFO L272 TraceCheckUtils]: 21: Hoare triple {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} call #t~ret5 := fibo2(~n - 2); {7075#true} is VALID [2022-02-20 18:15:41,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} is VALID [2022-02-20 18:15:41,906 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7075#true} {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} #53#return; {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} is VALID [2022-02-20 18:15:41,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {7075#true} assume true; {7075#true} is VALID [2022-02-20 18:15:41,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {7075#true} assume 1 == ~n;#res := 1; {7075#true} is VALID [2022-02-20 18:15:41,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {7075#true} assume !(~n < 1); {7075#true} is VALID [2022-02-20 18:15:41,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {7075#true} ~n := #in~n; {7075#true} is VALID [2022-02-20 18:15:41,907 INFO L272 TraceCheckUtils]: 14: Hoare triple {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} call #t~ret4 := fibo2(~n - 1); {7075#true} is VALID [2022-02-20 18:15:41,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} assume !(1 == ~n); {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} is VALID [2022-02-20 18:15:41,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} assume !(~n < 1); {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} is VALID [2022-02-20 18:15:41,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {7075#true} ~n := #in~n; {7568#(or (<= 3 |fibo1_#in~n|) (< fibo1_~n 3))} is VALID [2022-02-20 18:15:41,908 INFO L272 TraceCheckUtils]: 10: Hoare triple {7555#(or (<= 4 |fibo2_#in~n|) (< fibo2_~n 4))} call #t~ret6 := fibo1(~n - 1); {7075#true} is VALID [2022-02-20 18:15:41,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {7555#(or (<= 4 |fibo2_#in~n|) (< fibo2_~n 4))} assume !(1 == ~n); {7555#(or (<= 4 |fibo2_#in~n|) (< fibo2_~n 4))} is VALID [2022-02-20 18:15:41,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {7555#(or (<= 4 |fibo2_#in~n|) (< fibo2_~n 4))} assume !(~n < 1); {7555#(or (<= 4 |fibo2_#in~n|) (< fibo2_~n 4))} is VALID [2022-02-20 18:15:41,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {7075#true} ~n := #in~n; {7555#(or (<= 4 |fibo2_#in~n|) (< fibo2_~n 4))} is VALID [2022-02-20 18:15:41,909 INFO L272 TraceCheckUtils]: 6: Hoare triple {7521#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} call #t~ret4 := fibo2(~n - 1); {7075#true} is VALID [2022-02-20 18:15:41,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {7521#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} assume !(1 == ~n); {7521#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} is VALID [2022-02-20 18:15:41,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {7521#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} assume !(~n < 1); {7521#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} is VALID [2022-02-20 18:15:41,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {7075#true} ~n := #in~n; {7521#(or (<= 5 |fibo1_#in~n|) (< fibo1_~n 5))} is VALID [2022-02-20 18:15:41,910 INFO L272 TraceCheckUtils]: 2: Hoare triple {7077#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {7075#true} is VALID [2022-02-20 18:15:41,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {7075#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {7077#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 18:15:41,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {7075#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(18, 2);call #Ultimate.allocInit(12, 3); {7075#true} is VALID [2022-02-20 18:15:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 18:15:41,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805252924] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:41,911 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:41,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2022-02-20 18:15:41,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697526494] [2022-02-20 18:15:41,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:41,912 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) Word has length 66 [2022-02-20 18:15:41,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:41,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2022-02-20 18:15:41,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:41,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 18:15:41,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 18:15:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:15:41,976 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2022-02-20 18:15:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:42,431 INFO L93 Difference]: Finished difference Result 159 states and 234 transitions. [2022-02-20 18:15:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:15:42,431 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) Word has length 66 [2022-02-20 18:15:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2022-02-20 18:15:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2022-02-20 18:15:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2022-02-20 18:15:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2022-02-20 18:15:42,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 90 transitions. [2022-02-20 18:15:42,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:42,501 INFO L225 Difference]: With dead ends: 159 [2022-02-20 18:15:42,501 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 18:15:42,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:15:42,502 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:42,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 147 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:15:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 18:15:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 18:15:42,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:42,503 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:15:42,503 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:15:42,503 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:15:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:42,503 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:15:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:15:42,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:42,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:42,503 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:15:42,507 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:15:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:42,508 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:15:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:15:42,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:42,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:42,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:42,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:42,508 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:15:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 18:15:42,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2022-02-20 18:15:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:42,508 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 18:15:42,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2022-02-20 18:15:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:15:42,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:42,510 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:15:42,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:42,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:42,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 18:15:43,288 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 18:15:43,288 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 18:15:43,288 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 18:15:43,288 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 18:15:43,288 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2022-02-20 18:15:43,288 INFO L854 garLoopResultBuilder]: At program point L43(lines 37 44) the Hoare annotation is: (<= 4 |ULTIMATE.start_main_~x~0#1|) [2022-02-20 18:15:43,288 INFO L858 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-02-20 18:15:43,288 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-02-20 18:15:43,288 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|)) [2022-02-20 18:15:43,288 INFO L858 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-02-20 18:15:43,288 INFO L858 garLoopResultBuilder]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2022-02-20 18:15:43,288 INFO L861 garLoopResultBuilder]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2022-02-20 18:15:43,288 INFO L854 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (not (<= |fibo2_#in~n| 1)) (= fibo2_~n |fibo2_#in~n|)) [2022-02-20 18:15:43,289 INFO L858 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-02-20 18:15:43,289 INFO L854 garLoopResultBuilder]: At program point L25-2(line 25) the Hoare annotation is: (and (or (and (<= fibo2_~n 2) (<= |fibo2_#t~ret6| 1) (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret6|)) (not (<= |fibo2_#in~n| 3))) (= fibo2_~n |fibo2_#in~n|)) [2022-02-20 18:15:43,289 INFO L858 garLoopResultBuilder]: For program point L22(lines 22 26) no Hoare annotation was computed. [2022-02-20 18:15:43,289 INFO L858 garLoopResultBuilder]: For program point L25-3(line 25) no Hoare annotation was computed. [2022-02-20 18:15:43,289 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 26) no Hoare annotation was computed. [2022-02-20 18:15:43,289 INFO L858 garLoopResultBuilder]: For program point fibo2FINAL(lines 19 27) no Hoare annotation was computed. [2022-02-20 18:15:43,289 INFO L858 garLoopResultBuilder]: For program point fibo2EXIT(lines 19 27) no Hoare annotation was computed. [2022-02-20 18:15:43,289 INFO L861 garLoopResultBuilder]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2022-02-20 18:15:43,289 INFO L854 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2022-02-20 18:15:43,289 INFO L858 garLoopResultBuilder]: For program point L15-1(line 15) no Hoare annotation was computed. [2022-02-20 18:15:43,289 INFO L854 garLoopResultBuilder]: At program point L15-2(line 15) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#in~n| 3) .cse0 (<= |fibo1_#t~ret4| 1)) (and (<= 4 fibo1_~n) (<= 2 |fibo1_#t~ret4|) .cse0 (<= |fibo1_#t~ret4| 2)) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2022-02-20 18:15:43,289 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 16) no Hoare annotation was computed. [2022-02-20 18:15:43,289 INFO L858 garLoopResultBuilder]: For program point L15-3(line 15) no Hoare annotation was computed. [2022-02-20 18:15:43,289 INFO L858 garLoopResultBuilder]: For program point fibo1FINAL(lines 9 17) no Hoare annotation was computed. [2022-02-20 18:15:43,291 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 16) no Hoare annotation was computed. [2022-02-20 18:15:43,291 INFO L858 garLoopResultBuilder]: For program point fibo1EXIT(lines 9 17) no Hoare annotation was computed. [2022-02-20 18:15:43,293 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:43,294 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:15:43,297 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 18:15:43,297 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 18:15:43,297 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 18:15:43,297 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 18:15:43,297 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 18:15:43,297 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 18:15:43,297 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 18:15:43,297 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 18:15:43,297 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2022-02-20 18:15:43,298 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L25-3 has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2022-02-20 18:15:43,299 WARN L170 areAnnotationChecker]: L25-3 has no Hoare annotation [2022-02-20 18:15:43,300 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:15:43,300 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:15:43,300 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 18:15:43,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 06:15:43 BoogieIcfgContainer [2022-02-20 18:15:43,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 18:15:43,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 18:15:43,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 18:15:43,308 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 18:15:43,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:15:19" (3/4) ... [2022-02-20 18:15:43,312 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 18:15:43,317 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2022-02-20 18:15:43,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2022-02-20 18:15:43,325 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 18:15:43,325 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 18:15:43,325 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 18:15:43,325 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:15:43,358 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 18:15:43,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 18:15:43,360 INFO L158 Benchmark]: Toolchain (without parser) took 24528.41ms. Allocated memory was 90.2MB in the beginning and 281.0MB in the end (delta: 190.8MB). Free memory was 50.9MB in the beginning and 199.7MB in the end (delta: -148.7MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2022-02-20 18:15:43,360 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 90.2MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:15:43,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.51ms. Allocated memory is still 90.2MB. Free memory was 50.7MB in the beginning and 66.0MB in the end (delta: -15.3MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-02-20 18:15:43,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.52ms. Allocated memory is still 90.2MB. Free memory was 66.0MB in the beginning and 64.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:15:43,361 INFO L158 Benchmark]: Boogie Preprocessor took 32.05ms. Allocated memory is still 90.2MB. Free memory was 64.8MB in the beginning and 63.8MB in the end (delta: 976.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:15:43,361 INFO L158 Benchmark]: RCFGBuilder took 377.51ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 53.4MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:15:43,362 INFO L158 Benchmark]: TraceAbstraction took 23612.56ms. Allocated memory was 90.2MB in the beginning and 281.0MB in the end (delta: 190.8MB). Free memory was 52.6MB in the beginning and 201.8MB in the end (delta: -149.1MB). Peak memory consumption was 122.5MB. Max. memory is 16.1GB. [2022-02-20 18:15:43,362 INFO L158 Benchmark]: Witness Printer took 50.65ms. Allocated memory is still 281.0MB. Free memory was 201.8MB in the beginning and 199.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 18:15:43,363 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 90.2MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.51ms. Allocated memory is still 90.2MB. Free memory was 50.7MB in the beginning and 66.0MB in the end (delta: -15.3MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.52ms. Allocated memory is still 90.2MB. Free memory was 66.0MB in the beginning and 64.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.05ms. Allocated memory is still 90.2MB. Free memory was 64.8MB in the beginning and 63.8MB in the end (delta: 976.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 377.51ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 53.4MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23612.56ms. Allocated memory was 90.2MB in the beginning and 281.0MB in the end (delta: 190.8MB). Free memory was 52.6MB in the beginning and 201.8MB in the end (delta: -149.1MB). Peak memory consumption was 122.5MB. Max. memory is 16.1GB. * Witness Printer took 50.65ms. Allocated memory is still 281.0MB. Free memory was 201.8MB in the beginning and 199.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. 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: 41]: 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 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 521 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 445 mSDsluCounter, 2132 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1834 mSDsCounter, 366 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2168 IncrementalHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 366 mSolverCounterUnsat, 298 mSDtfsCounter, 2168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1116 GetRequests, 901 SyntacticMatches, 27 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=7, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 73 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 401 PreInvPairs, 487 NumberOfFragments, 89 HoareAnnotationTreeSize, 401 FomulaSimplifications, 1649 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 8 FomulaSimplificationsInter, 754 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1252 ConstructedInterpolants, 0 QuantifiedInterpolants, 3092 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1137 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 816/1143 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: 37]: Loop Invariant Derived loop invariant: 4 <= x RESULT: Ultimate proved your program to be correct! [2022-02-20 18:15:43,398 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