./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_2-2.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05dc78db4ae9adf9f9f4e8e18548ea9c0db83e87 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:10:03,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:10:03,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:10:03,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:10:03,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:10:03,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:10:03,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:10:03,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:10:03,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:10:03,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:10:03,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:10:03,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:10:03,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:10:03,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:10:03,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:10:03,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:10:03,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:10:03,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:10:03,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:10:03,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:10:03,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:10:03,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:10:03,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:10:03,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:10:03,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:10:03,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:10:03,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:10:03,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:10:03,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:10:03,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:10:03,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:10:03,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:10:03,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:10:03,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:10:03,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:10:03,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:10:03,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:10:03,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:10:03,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:10:03,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:10:03,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:10:03,809 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 19:10:03,845 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:10:03,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:10:03,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:10:03,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:10:03,851 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:10:03,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:10:03,853 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:10:03,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:10:03,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:10:03,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:10:03,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:10:03,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:10:03,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:10:03,855 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:10:03,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:10:03,856 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:10:03,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:10:03,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:10:03,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:10:03,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:10:03,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:10:03,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:10:03,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:10:03,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:10:03,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:10:03,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:10:03,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:10:03,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:10:03,862 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:10:03,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 05dc78db4ae9adf9f9f4e8e18548ea9c0db83e87 [2020-07-28 19:10:04,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:10:04,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:10:04,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:10:04,231 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:10:04,231 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:10:04,232 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c [2020-07-28 19:10:04,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0729c70b8/d3e7f82cffb64017bfd4508ed0799aeb/FLAGc8c4ce233 [2020-07-28 19:10:04,790 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:10:04,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c [2020-07-28 19:10:04,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0729c70b8/d3e7f82cffb64017bfd4508ed0799aeb/FLAGc8c4ce233 [2020-07-28 19:10:05,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0729c70b8/d3e7f82cffb64017bfd4508ed0799aeb [2020-07-28 19:10:05,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:10:05,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:10:05,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:10:05,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:10:05,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:10:05,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a438851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05, skipping insertion in model container [2020-07-28 19:10:05,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:10:05,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:10:05,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:10:05,388 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:10:05,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:10:05,424 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:10:05,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05 WrapperNode [2020-07-28 19:10:05,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:10:05,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:10:05,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:10:05,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:10:05,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:10:05,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:10:05,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:10:05,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:10:05,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:10:05,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:10:05,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:10:05,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:10:05,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:10:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:10:05,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:10:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-28 19:10:05,604 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-28 19:10:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-28 19:10:05,605 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-28 19:10:05,952 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:10:05,953 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 19:10:05,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:10:05 BoogieIcfgContainer [2020-07-28 19:10:05,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:10:05,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:10:05,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:10:05,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:10:05,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:10:05" (1/3) ... [2020-07-28 19:10:05,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f48bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:10:05, skipping insertion in model container [2020-07-28 19:10:05,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (2/3) ... [2020-07-28 19:10:05,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f48bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:10:05, skipping insertion in model container [2020-07-28 19:10:05,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:10:05" (3/3) ... [2020-07-28 19:10:05,968 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2020-07-28 19:10:05,980 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:10:05,986 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:10:06,001 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:10:06,023 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:10:06,023 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:10:06,024 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:10:06,024 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:10:06,024 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:10:06,024 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:10:06,025 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:10:06,025 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:10:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-28 19:10:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 19:10:06,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:06,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:06,055 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:06,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2020-07-28 19:10:06,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:10:06,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048319359] [2020-07-28 19:10:06,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:10:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:06,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:10:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:06,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} ~n := #in~n; {38#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:06,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {39#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:06,331 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(<= |fibo1_#in~n| 0)} assume true; {39#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:06,333 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#(<= |fibo1_#in~n| 0)} {33#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {32#false} is VALID [2020-07-28 19:10:06,344 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {33#(<= 2 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 19:10:06,344 INFO L263 TraceCheckUtils]: 1: Hoare triple {33#(<= 2 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {31#true} is VALID [2020-07-28 19:10:06,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} ~n := #in~n; {38#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:06,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {38#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {39#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:06,349 INFO L280 TraceCheckUtils]: 4: Hoare triple {39#(<= |fibo1_#in~n| 0)} assume true; {39#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:06,352 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {39#(<= |fibo1_#in~n| 0)} {33#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {32#false} is VALID [2020-07-28 19:10:06,352 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {32#false} is VALID [2020-07-28 19:10:06,353 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#false} assume 1 != main_~result~0; {32#false} is VALID [2020-07-28 19:10:06,354 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-28 19:10:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 19:10:06,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048319359] [2020-07-28 19:10:06,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:10:06,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 19:10:06,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925909972] [2020-07-28 19:10:06,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:10:06,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:06,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:10:06,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:06,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:10:06,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:10:06,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:10:06,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:10:06,414 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2020-07-28 19:10:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:06,710 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2020-07-28 19:10:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:10:06,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:10:06,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:10:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2020-07-28 19:10:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:10:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2020-07-28 19:10:06,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2020-07-28 19:10:06,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:06,817 INFO L225 Difference]: With dead ends: 38 [2020-07-28 19:10:06,817 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 19:10:06,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 19:10:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 19:10:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-28 19:10:06,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:06,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-28 19:10:06,871 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 19:10:06,871 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 19:10:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:06,879 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-28 19:10:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-28 19:10:06,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:06,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:06,882 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 19:10:06,882 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 19:10:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:06,888 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-28 19:10:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-28 19:10:06,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:06,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:06,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:06,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:06,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 19:10:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-07-28 19:10:06,897 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2020-07-28 19:10:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:06,898 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-28 19:10:06,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:10:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-28 19:10:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 19:10:06,900 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:06,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:06,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:10:06,901 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2020-07-28 19:10:06,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:10:06,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847763368] [2020-07-28 19:10:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:10:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:06,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:10:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:06,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {176#true} ~n := #in~n; {184#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:06,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {184#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {184#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:06,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {184#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {185#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:06,981 INFO L280 TraceCheckUtils]: 3: Hoare triple {185#(<= |fibo1_#in~n| 1)} assume true; {185#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:06,983 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {185#(<= |fibo1_#in~n| 1)} {178#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {177#false} is VALID [2020-07-28 19:10:06,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {176#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {178#(<= 2 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 19:10:06,988 INFO L263 TraceCheckUtils]: 1: Hoare triple {178#(<= 2 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {176#true} is VALID [2020-07-28 19:10:06,989 INFO L280 TraceCheckUtils]: 2: Hoare triple {176#true} ~n := #in~n; {184#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:06,990 INFO L280 TraceCheckUtils]: 3: Hoare triple {184#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {184#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:06,991 INFO L280 TraceCheckUtils]: 4: Hoare triple {184#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {185#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:06,992 INFO L280 TraceCheckUtils]: 5: Hoare triple {185#(<= |fibo1_#in~n| 1)} assume true; {185#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:06,994 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {185#(<= |fibo1_#in~n| 1)} {178#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {177#false} is VALID [2020-07-28 19:10:06,994 INFO L280 TraceCheckUtils]: 7: Hoare triple {177#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {177#false} is VALID [2020-07-28 19:10:06,995 INFO L280 TraceCheckUtils]: 8: Hoare triple {177#false} assume 1 != main_~result~0; {177#false} is VALID [2020-07-28 19:10:06,995 INFO L280 TraceCheckUtils]: 9: Hoare triple {177#false} assume !false; {177#false} is VALID [2020-07-28 19:10:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 19:10:06,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847763368] [2020-07-28 19:10:06,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:10:06,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 19:10:06,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249560728] [2020-07-28 19:10:06,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 19:10:07,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:07,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:10:07,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:07,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:10:07,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:10:07,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:10:07,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:10:07,017 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2020-07-28 19:10:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:07,221 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-28 19:10:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:10:07,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 19:10:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:10:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-28 19:10:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:10:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-28 19:10:07,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-28 19:10:07,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:07,292 INFO L225 Difference]: With dead ends: 32 [2020-07-28 19:10:07,292 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 19:10:07,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 19:10:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 19:10:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-28 19:10:07,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:07,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-28 19:10:07,306 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-28 19:10:07,306 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-28 19:10:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:07,311 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-28 19:10:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-07-28 19:10:07,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:07,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:07,313 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-28 19:10:07,313 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-28 19:10:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:07,317 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-28 19:10:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-07-28 19:10:07,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:07,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:07,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:07,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 19:10:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-07-28 19:10:07,323 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2020-07-28 19:10:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:07,324 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-28 19:10:07,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:10:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-28 19:10:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-28 19:10:07,325 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:07,326 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:07,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 19:10:07,326 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2020-07-28 19:10:07,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:10:07,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943281175] [2020-07-28 19:10:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:10:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:10:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:10:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#true} ~n := #in~n; {348#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:07,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,517 INFO L280 TraceCheckUtils]: 2: Hoare triple {349#(<= |fibo2_#in~n| 0)} assume true; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,520 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {349#(<= |fibo2_#in~n| 0)} {339#(< 1 fibo1_~n)} #52#return; {319#false} is VALID [2020-07-28 19:10:07,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-28 19:10:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {318#true} assume ~n < 1;#res := 0; {318#true} is VALID [2020-07-28 19:10:07,535 INFO L280 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2020-07-28 19:10:07,535 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {318#true} {319#false} #54#return; {319#false} is VALID [2020-07-28 19:10:07,536 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {318#true} assume !(~n < 1); {338#(< 0 fibo1_~n)} is VALID [2020-07-28 19:10:07,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {338#(< 0 fibo1_~n)} assume !(1 == ~n); {339#(< 1 fibo1_~n)} is VALID [2020-07-28 19:10:07,538 INFO L263 TraceCheckUtils]: 3: Hoare triple {339#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {318#true} is VALID [2020-07-28 19:10:07,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {318#true} ~n := #in~n; {348#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:07,540 INFO L280 TraceCheckUtils]: 5: Hoare triple {348#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,541 INFO L280 TraceCheckUtils]: 6: Hoare triple {349#(<= |fibo2_#in~n| 0)} assume true; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,543 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {349#(<= |fibo2_#in~n| 0)} {339#(< 1 fibo1_~n)} #52#return; {319#false} is VALID [2020-07-28 19:10:07,543 INFO L280 TraceCheckUtils]: 8: Hoare triple {319#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {319#false} is VALID [2020-07-28 19:10:07,544 INFO L263 TraceCheckUtils]: 9: Hoare triple {319#false} call #t~ret1 := fibo2(~n - 2); {318#true} is VALID [2020-07-28 19:10:07,545 INFO L280 TraceCheckUtils]: 10: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,545 INFO L280 TraceCheckUtils]: 11: Hoare triple {318#true} assume ~n < 1;#res := 0; {318#true} is VALID [2020-07-28 19:10:07,546 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#true} assume true; {318#true} is VALID [2020-07-28 19:10:07,547 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {318#true} {319#false} #54#return; {319#false} is VALID [2020-07-28 19:10:07,548 INFO L280 TraceCheckUtils]: 14: Hoare triple {319#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {319#false} is VALID [2020-07-28 19:10:07,553 INFO L280 TraceCheckUtils]: 15: Hoare triple {319#false} assume true; {319#false} is VALID [2020-07-28 19:10:07,553 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {319#false} {320#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {319#false} is VALID [2020-07-28 19:10:07,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {320#(<= 2 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 19:10:07,560 INFO L263 TraceCheckUtils]: 1: Hoare triple {320#(<= 2 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {318#true} is VALID [2020-07-28 19:10:07,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,562 INFO L280 TraceCheckUtils]: 3: Hoare triple {318#true} assume !(~n < 1); {338#(< 0 fibo1_~n)} is VALID [2020-07-28 19:10:07,563 INFO L280 TraceCheckUtils]: 4: Hoare triple {338#(< 0 fibo1_~n)} assume !(1 == ~n); {339#(< 1 fibo1_~n)} is VALID [2020-07-28 19:10:07,563 INFO L263 TraceCheckUtils]: 5: Hoare triple {339#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {318#true} is VALID [2020-07-28 19:10:07,564 INFO L280 TraceCheckUtils]: 6: Hoare triple {318#true} ~n := #in~n; {348#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:07,565 INFO L280 TraceCheckUtils]: 7: Hoare triple {348#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,566 INFO L280 TraceCheckUtils]: 8: Hoare triple {349#(<= |fibo2_#in~n| 0)} assume true; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,567 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {349#(<= |fibo2_#in~n| 0)} {339#(< 1 fibo1_~n)} #52#return; {319#false} is VALID [2020-07-28 19:10:07,568 INFO L280 TraceCheckUtils]: 10: Hoare triple {319#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {319#false} is VALID [2020-07-28 19:10:07,568 INFO L263 TraceCheckUtils]: 11: Hoare triple {319#false} call #t~ret1 := fibo2(~n - 2); {318#true} is VALID [2020-07-28 19:10:07,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,569 INFO L280 TraceCheckUtils]: 13: Hoare triple {318#true} assume ~n < 1;#res := 0; {318#true} is VALID [2020-07-28 19:10:07,569 INFO L280 TraceCheckUtils]: 14: Hoare triple {318#true} assume true; {318#true} is VALID [2020-07-28 19:10:07,569 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {318#true} {319#false} #54#return; {319#false} is VALID [2020-07-28 19:10:07,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {319#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {319#false} is VALID [2020-07-28 19:10:07,570 INFO L280 TraceCheckUtils]: 17: Hoare triple {319#false} assume true; {319#false} is VALID [2020-07-28 19:10:07,570 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {319#false} {320#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {319#false} is VALID [2020-07-28 19:10:07,571 INFO L280 TraceCheckUtils]: 19: Hoare triple {319#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {319#false} is VALID [2020-07-28 19:10:07,571 INFO L280 TraceCheckUtils]: 20: Hoare triple {319#false} assume 1 != main_~result~0; {319#false} is VALID [2020-07-28 19:10:07,572 INFO L280 TraceCheckUtils]: 21: Hoare triple {319#false} assume !false; {319#false} is VALID [2020-07-28 19:10:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 19:10:07,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943281175] [2020-07-28 19:10:07,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342529578] [2020-07-28 19:10:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:10:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 19:10:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:10:07,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {320#(<= 2 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 19:10:07,947 INFO L263 TraceCheckUtils]: 1: Hoare triple {320#(<= 2 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {318#true} is VALID [2020-07-28 19:10:07,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {318#true} ~n := #in~n; {359#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:07,951 INFO L280 TraceCheckUtils]: 3: Hoare triple {359#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {359#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:07,952 INFO L280 TraceCheckUtils]: 4: Hoare triple {359#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {359#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:07,952 INFO L263 TraceCheckUtils]: 5: Hoare triple {359#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {318#true} is VALID [2020-07-28 19:10:07,953 INFO L280 TraceCheckUtils]: 6: Hoare triple {318#true} ~n := #in~n; {372#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-28 19:10:07,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {372#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,956 INFO L280 TraceCheckUtils]: 8: Hoare triple {349#(<= |fibo2_#in~n| 0)} assume true; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,959 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {349#(<= |fibo2_#in~n| 0)} {359#(<= |fibo1_#in~n| fibo1_~n)} #52#return; {382#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:07,960 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {382#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:07,960 INFO L263 TraceCheckUtils]: 11: Hoare triple {382#(<= |fibo1_#in~n| 1)} call #t~ret1 := fibo2(~n - 2); {318#true} is VALID [2020-07-28 19:10:07,961 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,961 INFO L280 TraceCheckUtils]: 13: Hoare triple {318#true} assume ~n < 1;#res := 0; {318#true} is VALID [2020-07-28 19:10:07,961 INFO L280 TraceCheckUtils]: 14: Hoare triple {318#true} assume true; {318#true} is VALID [2020-07-28 19:10:07,963 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {318#true} {382#(<= |fibo1_#in~n| 1)} #54#return; {382#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:07,964 INFO L280 TraceCheckUtils]: 16: Hoare triple {382#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {382#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:07,965 INFO L280 TraceCheckUtils]: 17: Hoare triple {382#(<= |fibo1_#in~n| 1)} assume true; {382#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:07,967 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {382#(<= |fibo1_#in~n| 1)} {320#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {319#false} is VALID [2020-07-28 19:10:07,968 INFO L280 TraceCheckUtils]: 19: Hoare triple {319#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {319#false} is VALID [2020-07-28 19:10:07,968 INFO L280 TraceCheckUtils]: 20: Hoare triple {319#false} assume 1 != main_~result~0; {319#false} is VALID [2020-07-28 19:10:07,968 INFO L280 TraceCheckUtils]: 21: Hoare triple {319#false} assume !false; {319#false} is VALID [2020-07-28 19:10:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 19:10:07,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:10:07,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 19:10:07,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393877655] [2020-07-28 19:10:07,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-28 19:10:07,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:07,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 19:10:08,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:08,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 19:10:08,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:10:08,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 19:10:08,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:10:08,026 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 10 states. [2020-07-28 19:10:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:08,631 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-28 19:10:08,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 19:10:08,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-28 19:10:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:10:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-28 19:10:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:10:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-28 19:10:08,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2020-07-28 19:10:08,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:08,768 INFO L225 Difference]: With dead ends: 54 [2020-07-28 19:10:08,769 INFO L226 Difference]: Without dead ends: 30 [2020-07-28 19:10:08,770 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-28 19:10:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-28 19:10:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-28 19:10:08,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:08,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-28 19:10:08,786 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-28 19:10:08,786 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-28 19:10:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:08,791 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2020-07-28 19:10:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2020-07-28 19:10:08,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:08,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:08,792 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-28 19:10:08,792 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-28 19:10:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:08,796 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2020-07-28 19:10:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2020-07-28 19:10:08,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:08,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:08,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:08,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 19:10:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-28 19:10:08,801 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2020-07-28 19:10:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:08,801 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-28 19:10:08,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 19:10:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-28 19:10:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 19:10:08,803 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:08,804 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:09,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 19:10:09,019 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2020-07-28 19:10:09,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:10:09,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939526703] [2020-07-28 19:10:09,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:10:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:09,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:10:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:09,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:10:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:09,264 INFO L280 TraceCheckUtils]: 0: Hoare triple {590#true} ~n := #in~n; {590#true} is VALID [2020-07-28 19:10:09,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {590#true} assume !(~n < 1); {590#true} is VALID [2020-07-28 19:10:09,265 INFO L280 TraceCheckUtils]: 2: Hoare triple {590#true} assume 1 == ~n;#res := 1; {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-28 19:10:09,266 INFO L280 TraceCheckUtils]: 3: Hoare triple {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-28 19:10:09,267 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {590#true} #52#return; {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-28 19:10:09,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-07-28 19:10:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:09,299 INFO L280 TraceCheckUtils]: 0: Hoare triple {590#true} ~n := #in~n; {590#true} is VALID [2020-07-28 19:10:09,301 INFO L280 TraceCheckUtils]: 1: Hoare triple {590#true} assume ~n < 1;#res := 0; {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-28 19:10:09,303 INFO L280 TraceCheckUtils]: 2: Hoare triple {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-28 19:10:09,306 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #54#return; {622#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-28 19:10:09,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {590#true} ~n := #in~n; {590#true} is VALID [2020-07-28 19:10:09,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {590#true} assume !(~n < 1); {590#true} is VALID [2020-07-28 19:10:09,307 INFO L280 TraceCheckUtils]: 2: Hoare triple {590#true} assume !(1 == ~n); {590#true} is VALID [2020-07-28 19:10:09,307 INFO L263 TraceCheckUtils]: 3: Hoare triple {590#true} call #t~ret0 := fibo2(~n - 1); {590#true} is VALID [2020-07-28 19:10:09,307 INFO L280 TraceCheckUtils]: 4: Hoare triple {590#true} ~n := #in~n; {590#true} is VALID [2020-07-28 19:10:09,307 INFO L280 TraceCheckUtils]: 5: Hoare triple {590#true} assume !(~n < 1); {590#true} is VALID [2020-07-28 19:10:09,308 INFO L280 TraceCheckUtils]: 6: Hoare triple {590#true} assume 1 == ~n;#res := 1; {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-28 19:10:09,309 INFO L280 TraceCheckUtils]: 7: Hoare triple {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-28 19:10:09,310 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {590#true} #52#return; {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-28 19:10:09,310 INFO L280 TraceCheckUtils]: 9: Hoare triple {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-28 19:10:09,310 INFO L263 TraceCheckUtils]: 10: Hoare triple {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {590#true} is VALID [2020-07-28 19:10:09,311 INFO L280 TraceCheckUtils]: 11: Hoare triple {590#true} ~n := #in~n; {590#true} is VALID [2020-07-28 19:10:09,312 INFO L280 TraceCheckUtils]: 12: Hoare triple {590#true} assume ~n < 1;#res := 0; {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-28 19:10:09,313 INFO L280 TraceCheckUtils]: 13: Hoare triple {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-28 19:10:09,316 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #54#return; {622#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-28 19:10:09,317 INFO L280 TraceCheckUtils]: 15: Hoare triple {622#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-28 19:10:09,319 INFO L280 TraceCheckUtils]: 16: Hoare triple {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-28 19:10:09,321 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {590#true} #46#return; {610#(and (<= 1 |ULTIMATE.start_main_#t~ret4|) (<= |ULTIMATE.start_main_#t~ret4| 1))} is VALID [2020-07-28 19:10:09,323 INFO L280 TraceCheckUtils]: 0: Hoare triple {590#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {590#true} is VALID [2020-07-28 19:10:09,323 INFO L263 TraceCheckUtils]: 1: Hoare triple {590#true} call main_#t~ret4 := fibo1(main_~x~0); {590#true} is VALID [2020-07-28 19:10:09,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {590#true} ~n := #in~n; {590#true} is VALID [2020-07-28 19:10:09,323 INFO L280 TraceCheckUtils]: 3: Hoare triple {590#true} assume !(~n < 1); {590#true} is VALID [2020-07-28 19:10:09,324 INFO L280 TraceCheckUtils]: 4: Hoare triple {590#true} assume !(1 == ~n); {590#true} is VALID [2020-07-28 19:10:09,324 INFO L263 TraceCheckUtils]: 5: Hoare triple {590#true} call #t~ret0 := fibo2(~n - 1); {590#true} is VALID [2020-07-28 19:10:09,324 INFO L280 TraceCheckUtils]: 6: Hoare triple {590#true} ~n := #in~n; {590#true} is VALID [2020-07-28 19:10:09,324 INFO L280 TraceCheckUtils]: 7: Hoare triple {590#true} assume !(~n < 1); {590#true} is VALID [2020-07-28 19:10:09,326 INFO L280 TraceCheckUtils]: 8: Hoare triple {590#true} assume 1 == ~n;#res := 1; {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-28 19:10:09,328 INFO L280 TraceCheckUtils]: 9: Hoare triple {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-28 19:10:09,330 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {590#true} #52#return; {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-28 19:10:09,331 INFO L280 TraceCheckUtils]: 11: Hoare triple {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-28 19:10:09,332 INFO L263 TraceCheckUtils]: 12: Hoare triple {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {590#true} is VALID [2020-07-28 19:10:09,332 INFO L280 TraceCheckUtils]: 13: Hoare triple {590#true} ~n := #in~n; {590#true} is VALID [2020-07-28 19:10:09,333 INFO L280 TraceCheckUtils]: 14: Hoare triple {590#true} assume ~n < 1;#res := 0; {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-28 19:10:09,335 INFO L280 TraceCheckUtils]: 15: Hoare triple {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-28 19:10:09,336 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #54#return; {622#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-28 19:10:09,337 INFO L280 TraceCheckUtils]: 17: Hoare triple {622#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-28 19:10:09,338 INFO L280 TraceCheckUtils]: 18: Hoare triple {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-28 19:10:09,338 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {590#true} #46#return; {610#(and (<= 1 |ULTIMATE.start_main_#t~ret4|) (<= |ULTIMATE.start_main_#t~ret4| 1))} is VALID [2020-07-28 19:10:09,339 INFO L280 TraceCheckUtils]: 20: Hoare triple {610#(and (<= 1 |ULTIMATE.start_main_#t~ret4|) (<= |ULTIMATE.start_main_#t~ret4| 1))} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {611#(and (<= ULTIMATE.start_main_~result~0 1) (<= 1 ULTIMATE.start_main_~result~0))} is VALID [2020-07-28 19:10:09,340 INFO L280 TraceCheckUtils]: 21: Hoare triple {611#(and (<= ULTIMATE.start_main_~result~0 1) (<= 1 ULTIMATE.start_main_~result~0))} assume 1 != main_~result~0; {591#false} is VALID [2020-07-28 19:10:09,341 INFO L280 TraceCheckUtils]: 22: Hoare triple {591#false} assume !false; {591#false} is VALID [2020-07-28 19:10:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 19:10:09,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939526703] [2020-07-28 19:10:09,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973980109] [2020-07-28 19:10:09,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:10:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:09,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-28 19:10:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:09,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:10:09,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {590#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {590#true} is VALID [2020-07-28 19:10:09,674 INFO L263 TraceCheckUtils]: 1: Hoare triple {590#true} call main_#t~ret4 := fibo1(main_~x~0); {590#true} is VALID [2020-07-28 19:10:09,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {590#true} ~n := #in~n; {590#true} is VALID [2020-07-28 19:10:09,674 INFO L280 TraceCheckUtils]: 3: Hoare triple {590#true} assume !(~n < 1); {590#true} is VALID [2020-07-28 19:10:09,675 INFO L280 TraceCheckUtils]: 4: Hoare triple {590#true} assume !(1 == ~n); {590#true} is VALID [2020-07-28 19:10:09,675 INFO L263 TraceCheckUtils]: 5: Hoare triple {590#true} call #t~ret0 := fibo2(~n - 1); {590#true} is VALID [2020-07-28 19:10:09,675 INFO L280 TraceCheckUtils]: 6: Hoare triple {590#true} ~n := #in~n; {590#true} is VALID [2020-07-28 19:10:09,675 INFO L280 TraceCheckUtils]: 7: Hoare triple {590#true} assume !(~n < 1); {590#true} is VALID [2020-07-28 19:10:09,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {590#true} assume 1 == ~n;#res := 1; {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-28 19:10:09,679 INFO L280 TraceCheckUtils]: 9: Hoare triple {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-28 19:10:09,680 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {624#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {590#true} #52#return; {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-28 19:10:09,682 INFO L280 TraceCheckUtils]: 11: Hoare triple {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-28 19:10:09,682 INFO L263 TraceCheckUtils]: 12: Hoare triple {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {590#true} is VALID [2020-07-28 19:10:09,682 INFO L280 TraceCheckUtils]: 13: Hoare triple {590#true} ~n := #in~n; {590#true} is VALID [2020-07-28 19:10:09,683 INFO L280 TraceCheckUtils]: 14: Hoare triple {590#true} assume ~n < 1;#res := 0; {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-28 19:10:09,684 INFO L280 TraceCheckUtils]: 15: Hoare triple {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-28 19:10:09,685 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {625#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {617#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #54#return; {677#(and (<= 1 |fibo1_#t~ret0|) (<= 0 |fibo1_#t~ret1|) (<= |fibo1_#t~ret1| 0) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-28 19:10:09,687 INFO L280 TraceCheckUtils]: 17: Hoare triple {677#(and (<= 1 |fibo1_#t~ret0|) (<= 0 |fibo1_#t~ret1|) (<= |fibo1_#t~ret1| 0) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-28 19:10:09,687 INFO L280 TraceCheckUtils]: 18: Hoare triple {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-28 19:10:09,689 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {623#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {590#true} #46#return; {610#(and (<= 1 |ULTIMATE.start_main_#t~ret4|) (<= |ULTIMATE.start_main_#t~ret4| 1))} is VALID [2020-07-28 19:10:09,689 INFO L280 TraceCheckUtils]: 20: Hoare triple {610#(and (<= 1 |ULTIMATE.start_main_#t~ret4|) (<= |ULTIMATE.start_main_#t~ret4| 1))} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {611#(and (<= ULTIMATE.start_main_~result~0 1) (<= 1 ULTIMATE.start_main_~result~0))} is VALID [2020-07-28 19:10:09,690 INFO L280 TraceCheckUtils]: 21: Hoare triple {611#(and (<= ULTIMATE.start_main_~result~0 1) (<= 1 ULTIMATE.start_main_~result~0))} assume 1 != main_~result~0; {591#false} is VALID [2020-07-28 19:10:09,691 INFO L280 TraceCheckUtils]: 22: Hoare triple {591#false} assume !false; {591#false} is VALID [2020-07-28 19:10:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 19:10:09,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:10:09,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-28 19:10:09,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117570868] [2020-07-28 19:10:09,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-07-28 19:10:09,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:09,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 19:10:09,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:09,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 19:10:09,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:10:09,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 19:10:09,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:10:09,735 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2020-07-28 19:10:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:10,179 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-07-28 19:10:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 19:10:10,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-07-28 19:10:10,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:10:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2020-07-28 19:10:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:10:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2020-07-28 19:10:10,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2020-07-28 19:10:10,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:10,257 INFO L225 Difference]: With dead ends: 42 [2020-07-28 19:10:10,257 INFO L226 Difference]: Without dead ends: 38 [2020-07-28 19:10:10,257 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:10:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-28 19:10:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2020-07-28 19:10:10,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:10,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 33 states. [2020-07-28 19:10:10,281 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 33 states. [2020-07-28 19:10:10,281 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 33 states. [2020-07-28 19:10:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:10,286 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2020-07-28 19:10:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2020-07-28 19:10:10,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:10,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:10,288 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 38 states. [2020-07-28 19:10:10,288 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 38 states. [2020-07-28 19:10:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:10,298 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2020-07-28 19:10:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2020-07-28 19:10:10,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:10,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:10,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:10,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-28 19:10:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-07-28 19:10:10,303 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2020-07-28 19:10:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:10,304 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-07-28 19:10:10,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 19:10:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-07-28 19:10:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-28 19:10:10,305 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:10,305 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:10,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:10:10,513 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1239842987, now seen corresponding path program 1 times [2020-07-28 19:10:10,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:10:10,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869025794] [2020-07-28 19:10:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:10:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:10,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:10:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:10,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:10:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:10,597 INFO L280 TraceCheckUtils]: 0: Hoare triple {862#true} ~n := #in~n; {895#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {895#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {895#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,598 INFO L280 TraceCheckUtils]: 2: Hoare triple {895#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {896#(<= |fibo2_#in~n| 1)} is VALID [2020-07-28 19:10:10,599 INFO L280 TraceCheckUtils]: 3: Hoare triple {896#(<= |fibo2_#in~n| 1)} assume true; {896#(<= |fibo2_#in~n| 1)} is VALID [2020-07-28 19:10:10,600 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {896#(<= |fibo2_#in~n| 1)} {862#true} #52#return; {889#(<= fibo1_~n 2)} is VALID [2020-07-28 19:10:10,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-07-28 19:10:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:10,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {862#true} ~n := #in~n; {895#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {895#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {897#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,624 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#(<= 1 |fibo2_#in~n|)} assume true; {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,625 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {897#(<= 1 |fibo2_#in~n|)} {889#(<= fibo1_~n 2)} #54#return; {863#false} is VALID [2020-07-28 19:10:10,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {862#true} ~n := #in~n; {862#true} is VALID [2020-07-28 19:10:10,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {862#true} assume !(~n < 1); {862#true} is VALID [2020-07-28 19:10:10,627 INFO L280 TraceCheckUtils]: 2: Hoare triple {862#true} assume !(1 == ~n); {862#true} is VALID [2020-07-28 19:10:10,627 INFO L263 TraceCheckUtils]: 3: Hoare triple {862#true} call #t~ret0 := fibo2(~n - 1); {862#true} is VALID [2020-07-28 19:10:10,636 INFO L280 TraceCheckUtils]: 4: Hoare triple {862#true} ~n := #in~n; {895#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,637 INFO L280 TraceCheckUtils]: 5: Hoare triple {895#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {895#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,637 INFO L280 TraceCheckUtils]: 6: Hoare triple {895#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {896#(<= |fibo2_#in~n| 1)} is VALID [2020-07-28 19:10:10,638 INFO L280 TraceCheckUtils]: 7: Hoare triple {896#(<= |fibo2_#in~n| 1)} assume true; {896#(<= |fibo2_#in~n| 1)} is VALID [2020-07-28 19:10:10,640 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {896#(<= |fibo2_#in~n| 1)} {862#true} #52#return; {889#(<= fibo1_~n 2)} is VALID [2020-07-28 19:10:10,641 INFO L280 TraceCheckUtils]: 9: Hoare triple {889#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {889#(<= fibo1_~n 2)} is VALID [2020-07-28 19:10:10,641 INFO L263 TraceCheckUtils]: 10: Hoare triple {889#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {862#true} is VALID [2020-07-28 19:10:10,642 INFO L280 TraceCheckUtils]: 11: Hoare triple {862#true} ~n := #in~n; {895#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,647 INFO L280 TraceCheckUtils]: 12: Hoare triple {895#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,648 INFO L280 TraceCheckUtils]: 13: Hoare triple {897#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,648 INFO L280 TraceCheckUtils]: 14: Hoare triple {897#(<= 1 |fibo2_#in~n|)} assume true; {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,650 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {897#(<= 1 |fibo2_#in~n|)} {889#(<= fibo1_~n 2)} #54#return; {863#false} is VALID [2020-07-28 19:10:10,650 INFO L280 TraceCheckUtils]: 16: Hoare triple {863#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {863#false} is VALID [2020-07-28 19:10:10,650 INFO L280 TraceCheckUtils]: 17: Hoare triple {863#false} assume true; {863#false} is VALID [2020-07-28 19:10:10,650 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {863#false} {864#(<= ULTIMATE.start_main_~x~0 2)} #46#return; {863#false} is VALID [2020-07-28 19:10:10,652 INFO L280 TraceCheckUtils]: 0: Hoare triple {862#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {864#(<= ULTIMATE.start_main_~x~0 2)} is VALID [2020-07-28 19:10:10,652 INFO L263 TraceCheckUtils]: 1: Hoare triple {864#(<= ULTIMATE.start_main_~x~0 2)} call main_#t~ret4 := fibo1(main_~x~0); {862#true} is VALID [2020-07-28 19:10:10,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {862#true} ~n := #in~n; {862#true} is VALID [2020-07-28 19:10:10,652 INFO L280 TraceCheckUtils]: 3: Hoare triple {862#true} assume !(~n < 1); {862#true} is VALID [2020-07-28 19:10:10,653 INFO L280 TraceCheckUtils]: 4: Hoare triple {862#true} assume !(1 == ~n); {862#true} is VALID [2020-07-28 19:10:10,653 INFO L263 TraceCheckUtils]: 5: Hoare triple {862#true} call #t~ret0 := fibo2(~n - 1); {862#true} is VALID [2020-07-28 19:10:10,653 INFO L280 TraceCheckUtils]: 6: Hoare triple {862#true} ~n := #in~n; {895#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,654 INFO L280 TraceCheckUtils]: 7: Hoare triple {895#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {895#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,655 INFO L280 TraceCheckUtils]: 8: Hoare triple {895#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {896#(<= |fibo2_#in~n| 1)} is VALID [2020-07-28 19:10:10,655 INFO L280 TraceCheckUtils]: 9: Hoare triple {896#(<= |fibo2_#in~n| 1)} assume true; {896#(<= |fibo2_#in~n| 1)} is VALID [2020-07-28 19:10:10,656 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {896#(<= |fibo2_#in~n| 1)} {862#true} #52#return; {889#(<= fibo1_~n 2)} is VALID [2020-07-28 19:10:10,657 INFO L280 TraceCheckUtils]: 11: Hoare triple {889#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {889#(<= fibo1_~n 2)} is VALID [2020-07-28 19:10:10,657 INFO L263 TraceCheckUtils]: 12: Hoare triple {889#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {862#true} is VALID [2020-07-28 19:10:10,658 INFO L280 TraceCheckUtils]: 13: Hoare triple {862#true} ~n := #in~n; {895#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,658 INFO L280 TraceCheckUtils]: 14: Hoare triple {895#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,659 INFO L280 TraceCheckUtils]: 15: Hoare triple {897#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,659 INFO L280 TraceCheckUtils]: 16: Hoare triple {897#(<= 1 |fibo2_#in~n|)} assume true; {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,661 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {897#(<= 1 |fibo2_#in~n|)} {889#(<= fibo1_~n 2)} #54#return; {863#false} is VALID [2020-07-28 19:10:10,661 INFO L280 TraceCheckUtils]: 18: Hoare triple {863#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {863#false} is VALID [2020-07-28 19:10:10,661 INFO L280 TraceCheckUtils]: 19: Hoare triple {863#false} assume true; {863#false} is VALID [2020-07-28 19:10:10,661 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {863#false} {864#(<= ULTIMATE.start_main_~x~0 2)} #46#return; {863#false} is VALID [2020-07-28 19:10:10,662 INFO L280 TraceCheckUtils]: 21: Hoare triple {863#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {863#false} is VALID [2020-07-28 19:10:10,662 INFO L280 TraceCheckUtils]: 22: Hoare triple {863#false} assume 1 != main_~result~0; {863#false} is VALID [2020-07-28 19:10:10,662 INFO L280 TraceCheckUtils]: 23: Hoare triple {863#false} assume !false; {863#false} is VALID [2020-07-28 19:10:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 19:10:10,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869025794] [2020-07-28 19:10:10,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067895249] [2020-07-28 19:10:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:10:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:10,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 19:10:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:10,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:10:10,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {862#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {864#(<= ULTIMATE.start_main_~x~0 2)} is VALID [2020-07-28 19:10:10,901 INFO L263 TraceCheckUtils]: 1: Hoare triple {864#(<= ULTIMATE.start_main_~x~0 2)} call main_#t~ret4 := fibo1(main_~x~0); {862#true} is VALID [2020-07-28 19:10:10,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {862#true} ~n := #in~n; {907#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:10,902 INFO L280 TraceCheckUtils]: 3: Hoare triple {907#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {907#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:10,903 INFO L280 TraceCheckUtils]: 4: Hoare triple {907#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {907#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:10,903 INFO L263 TraceCheckUtils]: 5: Hoare triple {907#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {862#true} is VALID [2020-07-28 19:10:10,903 INFO L280 TraceCheckUtils]: 6: Hoare triple {862#true} ~n := #in~n; {862#true} is VALID [2020-07-28 19:10:10,903 INFO L280 TraceCheckUtils]: 7: Hoare triple {862#true} assume !(~n < 1); {862#true} is VALID [2020-07-28 19:10:10,904 INFO L280 TraceCheckUtils]: 8: Hoare triple {862#true} assume 1 == ~n;#res := 1; {862#true} is VALID [2020-07-28 19:10:10,904 INFO L280 TraceCheckUtils]: 9: Hoare triple {862#true} assume true; {862#true} is VALID [2020-07-28 19:10:10,905 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {862#true} {907#(<= fibo1_~n |fibo1_#in~n|)} #52#return; {907#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:10,906 INFO L280 TraceCheckUtils]: 11: Hoare triple {907#(<= fibo1_~n |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {907#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:10,906 INFO L263 TraceCheckUtils]: 12: Hoare triple {907#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {862#true} is VALID [2020-07-28 19:10:10,907 INFO L280 TraceCheckUtils]: 13: Hoare triple {862#true} ~n := #in~n; {941#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,908 INFO L280 TraceCheckUtils]: 14: Hoare triple {941#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,909 INFO L280 TraceCheckUtils]: 15: Hoare triple {897#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,909 INFO L280 TraceCheckUtils]: 16: Hoare triple {897#(<= 1 |fibo2_#in~n|)} assume true; {897#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:10,911 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {897#(<= 1 |fibo2_#in~n|)} {907#(<= fibo1_~n |fibo1_#in~n|)} #54#return; {954#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-28 19:10:10,911 INFO L280 TraceCheckUtils]: 18: Hoare triple {954#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {954#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-28 19:10:10,912 INFO L280 TraceCheckUtils]: 19: Hoare triple {954#(<= 3 |fibo1_#in~n|)} assume true; {954#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-28 19:10:10,913 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {954#(<= 3 |fibo1_#in~n|)} {864#(<= ULTIMATE.start_main_~x~0 2)} #46#return; {863#false} is VALID [2020-07-28 19:10:10,913 INFO L280 TraceCheckUtils]: 21: Hoare triple {863#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {863#false} is VALID [2020-07-28 19:10:10,913 INFO L280 TraceCheckUtils]: 22: Hoare triple {863#false} assume 1 != main_~result~0; {863#false} is VALID [2020-07-28 19:10:10,914 INFO L280 TraceCheckUtils]: 23: Hoare triple {863#false} assume !false; {863#false} is VALID [2020-07-28 19:10:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 19:10:10,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 19:10:10,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2020-07-28 19:10:10,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757751605] [2020-07-28 19:10:10,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-28 19:10:10,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:10,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 19:10:10,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:10,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 19:10:10,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:10:10,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 19:10:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:10:10,949 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 7 states. [2020-07-28 19:10:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:11,329 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2020-07-28 19:10:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 19:10:11,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-28 19:10:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:10:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-28 19:10:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:10:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-28 19:10:11,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2020-07-28 19:10:11,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:11,386 INFO L225 Difference]: With dead ends: 40 [2020-07-28 19:10:11,387 INFO L226 Difference]: Without dead ends: 36 [2020-07-28 19:10:11,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-28 19:10:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-28 19:10:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2020-07-28 19:10:11,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:11,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2020-07-28 19:10:11,407 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2020-07-28 19:10:11,408 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2020-07-28 19:10:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:11,411 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-07-28 19:10:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2020-07-28 19:10:11,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:11,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:11,412 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2020-07-28 19:10:11,412 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2020-07-28 19:10:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:11,415 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-07-28 19:10:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2020-07-28 19:10:11,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:11,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:11,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:11,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-28 19:10:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-07-28 19:10:11,419 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 24 [2020-07-28 19:10:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:11,420 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-07-28 19:10:11,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 19:10:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-07-28 19:10:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-28 19:10:11,421 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:11,421 INFO L422 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] [2020-07-28 19:10:11,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:10:11,633 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:11,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:11,634 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2020-07-28 19:10:11,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:10:11,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735013723] [2020-07-28 19:10:11,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:10:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:11,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:10:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:11,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:10:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:11,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:10:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:11,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#true} ~n := #in~n; {1202#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:11,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {1202#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1203#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:11,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {1203#(<= |fibo1_#in~n| 0)} assume true; {1203#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:11,833 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1203#(<= |fibo1_#in~n| 0)} {1193#(< 1 fibo2_~n)} #48#return; {1139#false} is VALID [2020-07-28 19:10:11,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-28 19:10:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:11,838 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {1138#true} assume ~n < 1;#res := 0; {1138#true} is VALID [2020-07-28 19:10:11,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {1138#true} assume true; {1138#true} is VALID [2020-07-28 19:10:11,839 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1138#true} {1139#false} #50#return; {1139#false} is VALID [2020-07-28 19:10:11,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {1138#true} assume !(~n < 1); {1192#(< 0 fibo2_~n)} is VALID [2020-07-28 19:10:11,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {1192#(< 0 fibo2_~n)} assume !(1 == ~n); {1193#(< 1 fibo2_~n)} is VALID [2020-07-28 19:10:11,842 INFO L263 TraceCheckUtils]: 3: Hoare triple {1193#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1138#true} is VALID [2020-07-28 19:10:11,843 INFO L280 TraceCheckUtils]: 4: Hoare triple {1138#true} ~n := #in~n; {1202#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:11,844 INFO L280 TraceCheckUtils]: 5: Hoare triple {1202#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1203#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:11,846 INFO L280 TraceCheckUtils]: 6: Hoare triple {1203#(<= |fibo1_#in~n| 0)} assume true; {1203#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:11,848 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1203#(<= |fibo1_#in~n| 0)} {1193#(< 1 fibo2_~n)} #48#return; {1139#false} is VALID [2020-07-28 19:10:11,849 INFO L280 TraceCheckUtils]: 8: Hoare triple {1139#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1139#false} is VALID [2020-07-28 19:10:11,849 INFO L263 TraceCheckUtils]: 9: Hoare triple {1139#false} call #t~ret3 := fibo1(~n - 2); {1138#true} is VALID [2020-07-28 19:10:11,849 INFO L280 TraceCheckUtils]: 10: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,850 INFO L280 TraceCheckUtils]: 11: Hoare triple {1138#true} assume ~n < 1;#res := 0; {1138#true} is VALID [2020-07-28 19:10:11,850 INFO L280 TraceCheckUtils]: 12: Hoare triple {1138#true} assume true; {1138#true} is VALID [2020-07-28 19:10:11,850 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1138#true} {1139#false} #50#return; {1139#false} is VALID [2020-07-28 19:10:11,850 INFO L280 TraceCheckUtils]: 14: Hoare triple {1139#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1139#false} is VALID [2020-07-28 19:10:11,851 INFO L280 TraceCheckUtils]: 15: Hoare triple {1139#false} assume true; {1139#false} is VALID [2020-07-28 19:10:11,851 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1139#false} {1138#true} #52#return; {1139#false} is VALID [2020-07-28 19:10:11,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-07-28 19:10:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:11,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {1138#true} assume ~n < 1;#res := 0; {1138#true} is VALID [2020-07-28 19:10:11,859 INFO L280 TraceCheckUtils]: 2: Hoare triple {1138#true} assume true; {1138#true} is VALID [2020-07-28 19:10:11,860 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1138#true} {1139#false} #54#return; {1139#false} is VALID [2020-07-28 19:10:11,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {1138#true} assume !(~n < 1); {1138#true} is VALID [2020-07-28 19:10:11,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {1138#true} assume !(1 == ~n); {1138#true} is VALID [2020-07-28 19:10:11,861 INFO L263 TraceCheckUtils]: 3: Hoare triple {1138#true} call #t~ret0 := fibo2(~n - 1); {1138#true} is VALID [2020-07-28 19:10:11,861 INFO L280 TraceCheckUtils]: 4: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,862 INFO L280 TraceCheckUtils]: 5: Hoare triple {1138#true} assume !(~n < 1); {1192#(< 0 fibo2_~n)} is VALID [2020-07-28 19:10:11,864 INFO L280 TraceCheckUtils]: 6: Hoare triple {1192#(< 0 fibo2_~n)} assume !(1 == ~n); {1193#(< 1 fibo2_~n)} is VALID [2020-07-28 19:10:11,864 INFO L263 TraceCheckUtils]: 7: Hoare triple {1193#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1138#true} is VALID [2020-07-28 19:10:11,865 INFO L280 TraceCheckUtils]: 8: Hoare triple {1138#true} ~n := #in~n; {1202#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:11,866 INFO L280 TraceCheckUtils]: 9: Hoare triple {1202#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1203#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:11,867 INFO L280 TraceCheckUtils]: 10: Hoare triple {1203#(<= |fibo1_#in~n| 0)} assume true; {1203#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:11,869 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1203#(<= |fibo1_#in~n| 0)} {1193#(< 1 fibo2_~n)} #48#return; {1139#false} is VALID [2020-07-28 19:10:11,869 INFO L280 TraceCheckUtils]: 12: Hoare triple {1139#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1139#false} is VALID [2020-07-28 19:10:11,869 INFO L263 TraceCheckUtils]: 13: Hoare triple {1139#false} call #t~ret3 := fibo1(~n - 2); {1138#true} is VALID [2020-07-28 19:10:11,870 INFO L280 TraceCheckUtils]: 14: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,870 INFO L280 TraceCheckUtils]: 15: Hoare triple {1138#true} assume ~n < 1;#res := 0; {1138#true} is VALID [2020-07-28 19:10:11,870 INFO L280 TraceCheckUtils]: 16: Hoare triple {1138#true} assume true; {1138#true} is VALID [2020-07-28 19:10:11,870 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1138#true} {1139#false} #50#return; {1139#false} is VALID [2020-07-28 19:10:11,871 INFO L280 TraceCheckUtils]: 18: Hoare triple {1139#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1139#false} is VALID [2020-07-28 19:10:11,871 INFO L280 TraceCheckUtils]: 19: Hoare triple {1139#false} assume true; {1139#false} is VALID [2020-07-28 19:10:11,871 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1139#false} {1138#true} #52#return; {1139#false} is VALID [2020-07-28 19:10:11,871 INFO L280 TraceCheckUtils]: 21: Hoare triple {1139#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1139#false} is VALID [2020-07-28 19:10:11,872 INFO L263 TraceCheckUtils]: 22: Hoare triple {1139#false} call #t~ret1 := fibo2(~n - 2); {1138#true} is VALID [2020-07-28 19:10:11,872 INFO L280 TraceCheckUtils]: 23: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,872 INFO L280 TraceCheckUtils]: 24: Hoare triple {1138#true} assume ~n < 1;#res := 0; {1138#true} is VALID [2020-07-28 19:10:11,872 INFO L280 TraceCheckUtils]: 25: Hoare triple {1138#true} assume true; {1138#true} is VALID [2020-07-28 19:10:11,872 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1138#true} {1139#false} #54#return; {1139#false} is VALID [2020-07-28 19:10:11,873 INFO L280 TraceCheckUtils]: 27: Hoare triple {1139#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1139#false} is VALID [2020-07-28 19:10:11,873 INFO L280 TraceCheckUtils]: 28: Hoare triple {1139#false} assume true; {1139#false} is VALID [2020-07-28 19:10:11,873 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1139#false} {1140#(<= ULTIMATE.start_main_~x~0 2)} #46#return; {1139#false} is VALID [2020-07-28 19:10:11,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {1140#(<= ULTIMATE.start_main_~x~0 2)} is VALID [2020-07-28 19:10:11,876 INFO L263 TraceCheckUtils]: 1: Hoare triple {1140#(<= ULTIMATE.start_main_~x~0 2)} call main_#t~ret4 := fibo1(main_~x~0); {1138#true} is VALID [2020-07-28 19:10:11,876 INFO L280 TraceCheckUtils]: 2: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,876 INFO L280 TraceCheckUtils]: 3: Hoare triple {1138#true} assume !(~n < 1); {1138#true} is VALID [2020-07-28 19:10:11,877 INFO L280 TraceCheckUtils]: 4: Hoare triple {1138#true} assume !(1 == ~n); {1138#true} is VALID [2020-07-28 19:10:11,877 INFO L263 TraceCheckUtils]: 5: Hoare triple {1138#true} call #t~ret0 := fibo2(~n - 1); {1138#true} is VALID [2020-07-28 19:10:11,877 INFO L280 TraceCheckUtils]: 6: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,878 INFO L280 TraceCheckUtils]: 7: Hoare triple {1138#true} assume !(~n < 1); {1192#(< 0 fibo2_~n)} is VALID [2020-07-28 19:10:11,880 INFO L280 TraceCheckUtils]: 8: Hoare triple {1192#(< 0 fibo2_~n)} assume !(1 == ~n); {1193#(< 1 fibo2_~n)} is VALID [2020-07-28 19:10:11,881 INFO L263 TraceCheckUtils]: 9: Hoare triple {1193#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1138#true} is VALID [2020-07-28 19:10:11,881 INFO L280 TraceCheckUtils]: 10: Hoare triple {1138#true} ~n := #in~n; {1202#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:11,882 INFO L280 TraceCheckUtils]: 11: Hoare triple {1202#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1203#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:11,883 INFO L280 TraceCheckUtils]: 12: Hoare triple {1203#(<= |fibo1_#in~n| 0)} assume true; {1203#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:11,884 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1203#(<= |fibo1_#in~n| 0)} {1193#(< 1 fibo2_~n)} #48#return; {1139#false} is VALID [2020-07-28 19:10:11,884 INFO L280 TraceCheckUtils]: 14: Hoare triple {1139#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1139#false} is VALID [2020-07-28 19:10:11,884 INFO L263 TraceCheckUtils]: 15: Hoare triple {1139#false} call #t~ret3 := fibo1(~n - 2); {1138#true} is VALID [2020-07-28 19:10:11,884 INFO L280 TraceCheckUtils]: 16: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,884 INFO L280 TraceCheckUtils]: 17: Hoare triple {1138#true} assume ~n < 1;#res := 0; {1138#true} is VALID [2020-07-28 19:10:11,885 INFO L280 TraceCheckUtils]: 18: Hoare triple {1138#true} assume true; {1138#true} is VALID [2020-07-28 19:10:11,885 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1138#true} {1139#false} #50#return; {1139#false} is VALID [2020-07-28 19:10:11,885 INFO L280 TraceCheckUtils]: 20: Hoare triple {1139#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1139#false} is VALID [2020-07-28 19:10:11,885 INFO L280 TraceCheckUtils]: 21: Hoare triple {1139#false} assume true; {1139#false} is VALID [2020-07-28 19:10:11,885 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1139#false} {1138#true} #52#return; {1139#false} is VALID [2020-07-28 19:10:11,886 INFO L280 TraceCheckUtils]: 23: Hoare triple {1139#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1139#false} is VALID [2020-07-28 19:10:11,886 INFO L263 TraceCheckUtils]: 24: Hoare triple {1139#false} call #t~ret1 := fibo2(~n - 2); {1138#true} is VALID [2020-07-28 19:10:11,886 INFO L280 TraceCheckUtils]: 25: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:11,886 INFO L280 TraceCheckUtils]: 26: Hoare triple {1138#true} assume ~n < 1;#res := 0; {1138#true} is VALID [2020-07-28 19:10:11,887 INFO L280 TraceCheckUtils]: 27: Hoare triple {1138#true} assume true; {1138#true} is VALID [2020-07-28 19:10:11,887 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1138#true} {1139#false} #54#return; {1139#false} is VALID [2020-07-28 19:10:11,887 INFO L280 TraceCheckUtils]: 29: Hoare triple {1139#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1139#false} is VALID [2020-07-28 19:10:11,887 INFO L280 TraceCheckUtils]: 30: Hoare triple {1139#false} assume true; {1139#false} is VALID [2020-07-28 19:10:11,888 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1139#false} {1140#(<= ULTIMATE.start_main_~x~0 2)} #46#return; {1139#false} is VALID [2020-07-28 19:10:11,888 INFO L280 TraceCheckUtils]: 32: Hoare triple {1139#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {1139#false} is VALID [2020-07-28 19:10:11,888 INFO L280 TraceCheckUtils]: 33: Hoare triple {1139#false} assume 1 != main_~result~0; {1139#false} is VALID [2020-07-28 19:10:11,888 INFO L280 TraceCheckUtils]: 34: Hoare triple {1139#false} assume !false; {1139#false} is VALID [2020-07-28 19:10:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-28 19:10:11,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735013723] [2020-07-28 19:10:11,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562455845] [2020-07-28 19:10:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:10:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:11,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-28 19:10:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:11,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:10:12,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {1140#(<= ULTIMATE.start_main_~x~0 2)} is VALID [2020-07-28 19:10:12,281 INFO L263 TraceCheckUtils]: 1: Hoare triple {1140#(<= ULTIMATE.start_main_~x~0 2)} call main_#t~ret4 := fibo1(main_~x~0); {1138#true} is VALID [2020-07-28 19:10:12,283 INFO L280 TraceCheckUtils]: 2: Hoare triple {1138#true} ~n := #in~n; {1213#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:12,284 INFO L280 TraceCheckUtils]: 3: Hoare triple {1213#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1213#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:12,285 INFO L280 TraceCheckUtils]: 4: Hoare triple {1213#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {1213#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:12,285 INFO L263 TraceCheckUtils]: 5: Hoare triple {1213#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {1138#true} is VALID [2020-07-28 19:10:12,286 INFO L280 TraceCheckUtils]: 6: Hoare triple {1138#true} ~n := #in~n; {1226#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:12,289 INFO L280 TraceCheckUtils]: 7: Hoare triple {1226#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1230#(and (<= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2020-07-28 19:10:12,290 INFO L280 TraceCheckUtils]: 8: Hoare triple {1230#(and (<= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume !(1 == ~n); {1234#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:12,290 INFO L263 TraceCheckUtils]: 9: Hoare triple {1234#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {1138#true} is VALID [2020-07-28 19:10:12,291 INFO L280 TraceCheckUtils]: 10: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:12,291 INFO L280 TraceCheckUtils]: 11: Hoare triple {1138#true} assume ~n < 1;#res := 0; {1138#true} is VALID [2020-07-28 19:10:12,291 INFO L280 TraceCheckUtils]: 12: Hoare triple {1138#true} assume true; {1138#true} is VALID [2020-07-28 19:10:12,292 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1138#true} {1234#(<= 2 |fibo2_#in~n|)} #48#return; {1234#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:12,293 INFO L280 TraceCheckUtils]: 14: Hoare triple {1234#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1234#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:12,293 INFO L263 TraceCheckUtils]: 15: Hoare triple {1234#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {1138#true} is VALID [2020-07-28 19:10:12,293 INFO L280 TraceCheckUtils]: 16: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:12,294 INFO L280 TraceCheckUtils]: 17: Hoare triple {1138#true} assume ~n < 1;#res := 0; {1138#true} is VALID [2020-07-28 19:10:12,294 INFO L280 TraceCheckUtils]: 18: Hoare triple {1138#true} assume true; {1138#true} is VALID [2020-07-28 19:10:12,295 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1138#true} {1234#(<= 2 |fibo2_#in~n|)} #50#return; {1234#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:12,295 INFO L280 TraceCheckUtils]: 20: Hoare triple {1234#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1234#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:12,296 INFO L280 TraceCheckUtils]: 21: Hoare triple {1234#(<= 2 |fibo2_#in~n|)} assume true; {1234#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-28 19:10:12,297 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1234#(<= 2 |fibo2_#in~n|)} {1213#(<= fibo1_~n |fibo1_#in~n|)} #52#return; {1277#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-28 19:10:12,297 INFO L280 TraceCheckUtils]: 23: Hoare triple {1277#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1277#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-28 19:10:12,297 INFO L263 TraceCheckUtils]: 24: Hoare triple {1277#(<= 3 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {1138#true} is VALID [2020-07-28 19:10:12,297 INFO L280 TraceCheckUtils]: 25: Hoare triple {1138#true} ~n := #in~n; {1138#true} is VALID [2020-07-28 19:10:12,298 INFO L280 TraceCheckUtils]: 26: Hoare triple {1138#true} assume ~n < 1;#res := 0; {1138#true} is VALID [2020-07-28 19:10:12,298 INFO L280 TraceCheckUtils]: 27: Hoare triple {1138#true} assume true; {1138#true} is VALID [2020-07-28 19:10:12,298 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1138#true} {1277#(<= 3 |fibo1_#in~n|)} #54#return; {1277#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-28 19:10:12,299 INFO L280 TraceCheckUtils]: 29: Hoare triple {1277#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1277#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-28 19:10:12,299 INFO L280 TraceCheckUtils]: 30: Hoare triple {1277#(<= 3 |fibo1_#in~n|)} assume true; {1277#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-28 19:10:12,300 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1277#(<= 3 |fibo1_#in~n|)} {1140#(<= ULTIMATE.start_main_~x~0 2)} #46#return; {1139#false} is VALID [2020-07-28 19:10:12,300 INFO L280 TraceCheckUtils]: 32: Hoare triple {1139#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {1139#false} is VALID [2020-07-28 19:10:12,300 INFO L280 TraceCheckUtils]: 33: Hoare triple {1139#false} assume 1 != main_~result~0; {1139#false} is VALID [2020-07-28 19:10:12,301 INFO L280 TraceCheckUtils]: 34: Hoare triple {1139#false} assume !false; {1139#false} is VALID [2020-07-28 19:10:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-28 19:10:12,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:10:12,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2020-07-28 19:10:12,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983661075] [2020-07-28 19:10:12,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2020-07-28 19:10:12,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:12,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 19:10:12,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:12,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 19:10:12,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:10:12,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 19:10:12,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-07-28 19:10:12,373 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 12 states. [2020-07-28 19:10:13,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:13,064 INFO L93 Difference]: Finished difference Result 65 states and 97 transitions. [2020-07-28 19:10:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 19:10:13,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2020-07-28 19:10:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 19:10:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2020-07-28 19:10:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 19:10:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2020-07-28 19:10:13,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 77 transitions. [2020-07-28 19:10:13,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:13,157 INFO L225 Difference]: With dead ends: 65 [2020-07-28 19:10:13,157 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 19:10:13,160 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2020-07-28 19:10:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 19:10:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 19:10:13,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:13,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 19:10:13,160 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:10:13,160 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:10:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:13,161 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:10:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:10:13,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:13,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:13,161 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:10:13,161 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:10:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:13,162 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:10:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:10:13,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:13,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:13,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:13,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 19:10:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 19:10:13,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2020-07-28 19:10:13,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:13,163 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 19:10:13,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 19:10:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:10:13,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:13,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:10:13,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 19:10:13,520 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 19:10:13,520 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 19:10:13,521 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 19:10:13,521 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2020-07-28 19:10:13,521 INFO L264 CegarLoopResult]: At program point L41(lines 35 42) the Hoare annotation is: (<= 2 ULTIMATE.start_main_~x~0) [2020-07-28 19:10:13,521 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-28 19:10:13,521 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-07-28 19:10:13,521 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2)) [2020-07-28 19:10:13,521 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-07-28 19:10:13,521 INFO L268 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2020-07-28 19:10:13,522 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-07-28 19:10:13,522 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-28 19:10:13,522 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-28 19:10:13,522 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-28 19:10:13,522 INFO L268 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2020-07-28 19:10:13,523 INFO L268 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2020-07-28 19:10:13,523 INFO L268 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2020-07-28 19:10:13,523 INFO L268 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2020-07-28 19:10:13,523 INFO L268 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2020-07-28 19:10:13,523 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-07-28 19:10:13,523 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-28 19:10:13,523 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-28 19:10:13,524 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#in~n|) .cse0) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) .cse0))) [2020-07-28 19:10:13,524 INFO L268 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2020-07-28 19:10:13,524 INFO L268 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2020-07-28 19:10:13,524 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-07-28 19:10:13,524 INFO L268 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2020-07-28 19:10:13,524 INFO L268 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2020-07-28 19:10:13,528 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 19:10:13,528 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-28 19:10:13,528 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 19:10:13,528 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 19:10:13,529 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-28 19:10:13,530 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-28 19:10:13,530 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-28 19:10:13,530 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-28 19:10:13,530 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-28 19:10:13,530 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-28 19:10:13,530 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-28 19:10:13,530 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-28 19:10:13,530 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 19:10:13,530 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-28 19:10:13,530 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-28 19:10:13,531 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-28 19:10:13,531 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 19:10:13,531 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 19:10:13,531 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-28 19:10:13,531 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-28 19:10:13,531 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:10:13,531 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 19:10:13,531 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-28 19:10:13,531 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:10:13,531 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. [2020-07-28 19:10:13,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 07:10:13 BoogieIcfgContainer [2020-07-28 19:10:13,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 19:10:13,542 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 19:10:13,542 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 19:10:13,542 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 19:10:13,543 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:10:05" (3/4) ... [2020-07-28 19:10:13,547 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 19:10:13,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2020-07-28 19:10:13,554 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2020-07-28 19:10:13,559 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-07-28 19:10:13,560 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 19:10:13,615 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 19:10:13,615 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 19:10:13,618 INFO L168 Benchmark]: Toolchain (without parser) took 8441.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.8 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -115.2 MB). Peak memory consumption was 172.6 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:13,619 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:10:13,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:13,620 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:13,620 INFO L168 Benchmark]: Boogie Preprocessor took 17.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:13,621 INFO L168 Benchmark]: RCFGBuilder took 412.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:13,621 INFO L168 Benchmark]: TraceAbstraction took 7582.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 169.8 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:13,622 INFO L168 Benchmark]: Witness Printer took 73.27 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:13,625 INFO L336 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 412.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7582.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 169.8 MB. Max. memory is 11.5 GB. * Witness Printer took 73.27 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 2 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.3s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 143 SDtfs, 104 SDslu, 612 SDs, 0 SdLazy, 450 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 47 PreInvPairs, 57 NumberOfFragments, 54 HoareAnnotationTreeSize, 47 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 33 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 12203 SizeOfPredicates, 10 NumberOfNonLiveVariables, 239 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 35/58 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...