./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3562c726fb0df5872bc6ae08c11ec0d40862c19 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:32:54,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:32:54,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:32:54,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:32:54,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:32:54,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:32:54,291 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:32:54,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:32:54,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:32:54,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:32:54,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:32:54,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:32:54,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:32:54,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:32:54,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:32:54,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:32:54,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:32:54,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:32:54,301 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:32:54,302 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:32:54,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:32:54,304 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:32:54,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:32:54,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:32:54,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:32:54,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:32:54,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:32:54,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:32:54,308 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:32:54,309 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:32:54,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:32:54,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:32:54,310 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:32:54,310 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:32:54,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:32:54,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:32:54,312 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-10 07:32:54,322 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:32:54,322 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:32:54,323 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:32:54,323 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:32:54,323 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:32:54,323 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:32:54,323 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:32:54,323 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:32:54,323 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:32:54,323 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:32:54,324 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:32:54,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:32:54,324 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:32:54,324 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:32:54,325 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:32:54,325 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:32:54,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:32:54,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:32:54,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:32:54,325 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:32:54,325 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 07:32:54,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:32:54,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:32:54,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:32:54,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:32:54,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:32:54,326 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:32:54,326 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:32:54,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:32:54,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:32:54,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:32:54,327 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:32:54,327 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:32:54,327 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:32:54,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:32:54,327 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:32:54,327 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> d3562c726fb0df5872bc6ae08c11ec0d40862c19 [2018-11-10 07:32:54,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:32:54,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:32:54,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:32:54,360 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:32:54,360 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:32:54,360 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-11-10 07:32:54,396 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/data/3bbbbc08a/e0720f936bd24dd4a30ab7f35958aa96/FLAG2aca0286c [2018-11-10 07:32:54,718 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:32:54,719 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-11-10 07:32:54,723 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/data/3bbbbc08a/e0720f936bd24dd4a30ab7f35958aa96/FLAG2aca0286c [2018-11-10 07:32:54,733 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/data/3bbbbc08a/e0720f936bd24dd4a30ab7f35958aa96 [2018-11-10 07:32:54,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:32:54,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:32:54,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:32:54,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:32:54,740 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:32:54,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:32:54" (1/1) ... [2018-11-10 07:32:54,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1788b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54, skipping insertion in model container [2018-11-10 07:32:54,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:32:54" (1/1) ... [2018-11-10 07:32:54,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:32:54,758 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:32:54,856 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:32:54,858 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:32:54,868 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:32:54,876 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:32:54,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54 WrapperNode [2018-11-10 07:32:54,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:32:54,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:32:54,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:32:54,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:32:54,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54" (1/1) ... [2018-11-10 07:32:54,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54" (1/1) ... [2018-11-10 07:32:54,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:32:54,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:32:54,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:32:54,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:32:54,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54" (1/1) ... [2018-11-10 07:32:54,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54" (1/1) ... [2018-11-10 07:32:54,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54" (1/1) ... [2018-11-10 07:32:54,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54" (1/1) ... [2018-11-10 07:32:54,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54" (1/1) ... [2018-11-10 07:32:54,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54" (1/1) ... [2018-11-10 07:32:54,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54" (1/1) ... [2018-11-10 07:32:54,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:32:54,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:32:54,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:32:54,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:32:54,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/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 [2018-11-10 07:32:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-10 07:32:54,968 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-10 07:32:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:32:54,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:32:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:32:54,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:32:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:32:54,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:32:55,065 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:32:55,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:32:55 BoogieIcfgContainer [2018-11-10 07:32:55,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:32:55,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:32:55,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:32:55,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:32:55,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:32:54" (1/3) ... [2018-11-10 07:32:55,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f34c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:32:55, skipping insertion in model container [2018-11-10 07:32:55,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:54" (2/3) ... [2018-11-10 07:32:55,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f34c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:32:55, skipping insertion in model container [2018-11-10 07:32:55,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:32:55" (3/3) ... [2018-11-10 07:32:55,071 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-11-10 07:32:55,079 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:32:55,084 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-10 07:32:55,095 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-10 07:32:55,117 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:32:55,118 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:32:55,118 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:32:55,118 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:32:55,118 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:32:55,118 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:32:55,118 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:32:55,118 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:32:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-10 07:32:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 07:32:55,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:55,137 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:55,139 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:32:55,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:55,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1707029017, now seen corresponding path program 1 times [2018-11-10 07:32:55,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:55,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:55,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:55,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:55,181 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:32:55,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:32:55,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:32:55,258 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:32:55,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:32:55,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:32:55,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:32:55,270 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2018-11-10 07:32:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:32:55,356 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-10 07:32:55,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:32:55,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-10 07:32:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:32:55,365 INFO L225 Difference]: With dead ends: 38 [2018-11-10 07:32:55,366 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 07:32:55,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:32:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 07:32:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 07:32:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 07:32:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-10 07:32:55,393 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 10 [2018-11-10 07:32:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:32:55,394 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 07:32:55,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:32:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-10 07:32:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 07:32:55,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:55,395 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:55,396 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:32:55,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1378291933, now seen corresponding path program 1 times [2018-11-10 07:32:55,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:55,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:55,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:55,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:55,397 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:32:55,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:32:55,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:32:55,426 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:32:55,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:32:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:32:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:32:55,428 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-11-10 07:32:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:32:55,445 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-10 07:32:55,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:32:55,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 07:32:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:32:55,448 INFO L225 Difference]: With dead ends: 27 [2018-11-10 07:32:55,448 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 07:32:55,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:32:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 07:32:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-10 07:32:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 07:32:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-10 07:32:55,454 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 11 [2018-11-10 07:32:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:32:55,454 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-10 07:32:55,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:32:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-10 07:32:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 07:32:55,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:55,455 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:55,455 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:32:55,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash -995069271, now seen corresponding path program 1 times [2018-11-10 07:32:55,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:55,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:55,457 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 07:32:55,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:32:55,563 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:32:55,564 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-10 07:32:55,566 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [14], [16], [18], [20], [21], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-11-10 07:32:55,606 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:32:55,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:32:55,699 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:32:55,700 INFO L272 AbstractInterpreter]: Visited 14 different actions 35 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-10 07:32:55,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:55,703 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:32:55,760 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 07:32:55,760 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:32:55,856 INFO L415 sIntCurrentIteration]: We unified 31 AI predicates to 31 [2018-11-10 07:32:55,856 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:32:55,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:32:55,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-10 07:32:55,857 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:32:55,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 07:32:55,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 07:32:55,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-10 07:32:55,858 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 12 states. [2018-11-10 07:32:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:32:56,419 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-11-10 07:32:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 07:32:56,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-10 07:32:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:32:56,421 INFO L225 Difference]: With dead ends: 82 [2018-11-10 07:32:56,421 INFO L226 Difference]: Without dead ends: 65 [2018-11-10 07:32:56,422 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-11-10 07:32:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-10 07:32:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-11-10 07:32:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 07:32:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2018-11-10 07:32:56,435 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 32 [2018-11-10 07:32:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:32:56,435 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2018-11-10 07:32:56,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 07:32:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2018-11-10 07:32:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:32:56,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:56,437 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:56,438 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:32:56,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:56,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1827353855, now seen corresponding path program 1 times [2018-11-10 07:32:56,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:56,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:56,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:56,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:56,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:32:56,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:32:56,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:32:56,481 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:32:56,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:32:56,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:32:56,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:32:56,482 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 6 states. [2018-11-10 07:32:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:32:56,521 INFO L93 Difference]: Finished difference Result 94 states and 128 transitions. [2018-11-10 07:32:56,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:32:56,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-10 07:32:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:32:56,523 INFO L225 Difference]: With dead ends: 94 [2018-11-10 07:32:56,523 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 07:32:56,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:32:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 07:32:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2018-11-10 07:32:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 07:32:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2018-11-10 07:32:56,536 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 27 [2018-11-10 07:32:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:32:56,536 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2018-11-10 07:32:56,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:32:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2018-11-10 07:32:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:32:56,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:56,537 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:56,538 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:32:56,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash 813394711, now seen corresponding path program 1 times [2018-11-10 07:32:56,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:56,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:56,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:56,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:56,539 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:32:56,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:32:56,574 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:32:56,574 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-10 07:32:56,574 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [22], [23], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-11-10 07:32:56,576 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:32:56,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:32:56,769 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:32:56,769 INFO L272 AbstractInterpreter]: Visited 24 different actions 502 times. Merged at 5 different actions 67 times. Never widened. Found 19 fixpoints after 2 different actions. Largest state had 5 variables. [2018-11-10 07:32:56,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:56,774 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:32:56,800 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 46.49% of their original sizes. [2018-11-10 07:32:56,800 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:32:56,916 INFO L415 sIntCurrentIteration]: We unified 27 AI predicates to 27 [2018-11-10 07:32:56,917 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:32:56,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:32:56,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 17 [2018-11-10 07:32:56,917 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:32:56,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 07:32:56,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 07:32:56,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:32:56,918 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand 15 states. [2018-11-10 07:32:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:32:58,605 INFO L93 Difference]: Finished difference Result 215 states and 285 transitions. [2018-11-10 07:32:58,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 07:32:58,605 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-11-10 07:32:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:32:58,607 INFO L225 Difference]: With dead ends: 215 [2018-11-10 07:32:58,607 INFO L226 Difference]: Without dead ends: 202 [2018-11-10 07:32:58,608 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 07:32:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-10 07:32:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 171. [2018-11-10 07:32:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-10 07:32:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 232 transitions. [2018-11-10 07:32:58,631 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 232 transitions. Word has length 28 [2018-11-10 07:32:58,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:32:58,631 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 232 transitions. [2018-11-10 07:32:58,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 07:32:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2018-11-10 07:32:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 07:32:58,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:58,634 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:58,635 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:32:58,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:58,635 INFO L82 PathProgramCache]: Analyzing trace with hash 362301106, now seen corresponding path program 1 times [2018-11-10 07:32:58,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:58,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:58,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:58,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:58,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 07:32:58,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:32:58,685 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:32:58,685 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-10 07:32:58,685 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [21], [22], [24], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-11-10 07:32:58,688 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:32:58,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:33:01,097 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:33:01,097 INFO L272 AbstractInterpreter]: Visited 25 different actions 10255 times. Merged at 10 different actions 2760 times. Never widened. Found 730 fixpoints after 5 different actions. Largest state had 5 variables. [2018-11-10 07:33:01,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:01,113 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:33:01,147 INFO L227 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 49.07% of their original sizes. [2018-11-10 07:33:01,148 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:33:01,454 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-11-10 07:33:01,454 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:33:01,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:33:01,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [7] total 30 [2018-11-10 07:33:01,455 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:33:01,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 07:33:01,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 07:33:01,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2018-11-10 07:33:01,456 INFO L87 Difference]: Start difference. First operand 171 states and 232 transitions. Second operand 25 states. [2018-11-10 07:33:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:06,301 INFO L93 Difference]: Finished difference Result 533 states and 765 transitions. [2018-11-10 07:33:06,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-10 07:33:06,302 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-11-10 07:33:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:33:06,306 INFO L225 Difference]: With dead ends: 533 [2018-11-10 07:33:06,306 INFO L226 Difference]: Without dead ends: 526 [2018-11-10 07:33:06,309 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 114 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2076 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1665, Invalid=5645, Unknown=0, NotChecked=0, Total=7310 [2018-11-10 07:33:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-11-10 07:33:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 189. [2018-11-10 07:33:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-10 07:33:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 242 transitions. [2018-11-10 07:33:06,339 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 242 transitions. Word has length 47 [2018-11-10 07:33:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:33:06,340 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 242 transitions. [2018-11-10 07:33:06,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 07:33:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 242 transitions. [2018-11-10 07:33:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 07:33:06,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:33:06,342 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:06,342 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:33:06,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash -589491361, now seen corresponding path program 2 times [2018-11-10 07:33:06,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:33:06,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:06,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:06,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:06,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:33:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 07:33:06,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:06,397 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:33:06,397 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:33:06,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:33:06,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:06,398 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:33:06,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:33:06,407 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 07:33:06,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 07:33:06,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:33:06,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 57 proven. 20 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 07:33:06,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:33:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 07:33:06,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:33:06,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 13 [2018-11-10 07:33:06,805 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:33:06,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:33:06,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:33:06,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-10 07:33:06,806 INFO L87 Difference]: Start difference. First operand 189 states and 242 transitions. Second operand 8 states. [2018-11-10 07:33:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:06,963 INFO L93 Difference]: Finished difference Result 426 states and 594 transitions. [2018-11-10 07:33:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 07:33:06,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-11-10 07:33:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:33:06,966 INFO L225 Difference]: With dead ends: 426 [2018-11-10 07:33:06,966 INFO L226 Difference]: Without dead ends: 259 [2018-11-10 07:33:06,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-11-10 07:33:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-10 07:33:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 225. [2018-11-10 07:33:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-10 07:33:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 282 transitions. [2018-11-10 07:33:06,994 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 282 transitions. Word has length 67 [2018-11-10 07:33:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:33:06,995 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 282 transitions. [2018-11-10 07:33:06,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:33:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 282 transitions. [2018-11-10 07:33:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 07:33:06,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:33:06,997 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:06,997 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:33:06,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:06,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1653738638, now seen corresponding path program 3 times [2018-11-10 07:33:06,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:33:06,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:06,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:33:06,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:06,999 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:33:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 88 proven. 10 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-10 07:33:07,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:07,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:33:07,125 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:33:07,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:33:07,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:07,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:33:07,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:33:07,132 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 07:33:07,146 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:33:07,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:33:07,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 38 proven. 83 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-10 07:33:07,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:33:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 38 proven. 85 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-10 07:33:07,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:33:07,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2018-11-10 07:33:07,430 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:33:07,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 07:33:07,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 07:33:07,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-10 07:33:07,430 INFO L87 Difference]: Start difference. First operand 225 states and 282 transitions. Second operand 14 states. [2018-11-10 07:33:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:07,594 INFO L93 Difference]: Finished difference Result 518 states and 696 transitions. [2018-11-10 07:33:07,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:33:07,594 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-11-10 07:33:07,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:33:07,596 INFO L225 Difference]: With dead ends: 518 [2018-11-10 07:33:07,596 INFO L226 Difference]: Without dead ends: 322 [2018-11-10 07:33:07,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 155 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2018-11-10 07:33:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-10 07:33:07,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 282. [2018-11-10 07:33:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-10 07:33:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2018-11-10 07:33:07,614 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 85 [2018-11-10 07:33:07,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:33:07,615 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2018-11-10 07:33:07,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 07:33:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2018-11-10 07:33:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 07:33:07,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:33:07,616 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:07,616 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:33:07,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:07,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1769690055, now seen corresponding path program 4 times [2018-11-10 07:33:07,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:33:07,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:33:07,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,617 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:33:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 113 proven. 98 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-10 07:33:07,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:07,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:33:07,727 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:33:07,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:33:07,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:07,728 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:33:07,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:07,738 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 07:33:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:07,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 70 proven. 156 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-10 07:33:07,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:33:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 69 proven. 167 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 07:33:08,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:33:08,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 20 [2018-11-10 07:33:08,128 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:33:08,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 07:33:08,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 07:33:08,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-11-10 07:33:08,129 INFO L87 Difference]: Start difference. First operand 282 states and 347 transitions. Second operand 14 states. [2018-11-10 07:33:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:08,490 INFO L93 Difference]: Finished difference Result 609 states and 801 transitions. [2018-11-10 07:33:08,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 07:33:08,491 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 106 [2018-11-10 07:33:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:33:08,492 INFO L225 Difference]: With dead ends: 609 [2018-11-10 07:33:08,493 INFO L226 Difference]: Without dead ends: 363 [2018-11-10 07:33:08,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 195 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2018-11-10 07:33:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-11-10 07:33:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 337. [2018-11-10 07:33:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-10 07:33:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 420 transitions. [2018-11-10 07:33:08,510 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 420 transitions. Word has length 106 [2018-11-10 07:33:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:33:08,511 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 420 transitions. [2018-11-10 07:33:08,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 07:33:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 420 transitions. [2018-11-10 07:33:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 07:33:08,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:33:08,513 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 13, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:08,514 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:33:08,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:08,514 INFO L82 PathProgramCache]: Analyzing trace with hash -730963975, now seen corresponding path program 5 times [2018-11-10 07:33:08,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:33:08,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:08,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:08,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:08,515 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:33:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2018-11-10 07:33:08,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:08,614 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:33:08,615 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:33:08,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:33:08,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:08,615 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:33:08,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:33:08,621 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 07:33:08,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-10 07:33:08,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:33:08,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2018-11-10 07:33:08,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:33:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 144 proven. 122 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-10 07:33:09,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:33:09,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2018-11-10 07:33:09,443 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:33:09,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 07:33:09,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 07:33:09,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-11-10 07:33:09,444 INFO L87 Difference]: Start difference. First operand 337 states and 420 transitions. Second operand 17 states. [2018-11-10 07:33:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:09,555 INFO L93 Difference]: Finished difference Result 634 states and 842 transitions. [2018-11-10 07:33:09,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 07:33:09,556 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 151 [2018-11-10 07:33:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:33:09,559 INFO L225 Difference]: With dead ends: 634 [2018-11-10 07:33:09,559 INFO L226 Difference]: Without dead ends: 633 [2018-11-10 07:33:09,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 289 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-11-10 07:33:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-11-10 07:33:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 470. [2018-11-10 07:33:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-11-10 07:33:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 610 transitions. [2018-11-10 07:33:09,594 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 610 transitions. Word has length 151 [2018-11-10 07:33:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:33:09,594 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 610 transitions. [2018-11-10 07:33:09,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 07:33:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 610 transitions. [2018-11-10 07:33:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 07:33:09,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:33:09,597 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 15, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:09,598 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:33:09,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash 267240876, now seen corresponding path program 6 times [2018-11-10 07:33:09,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:33:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:09,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:33:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:09,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:33:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 160 proven. 257 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2018-11-10 07:33:09,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:09,701 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:33:09,701 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:33:09,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:33:09,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:09,701 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:33:09,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:33:09,707 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 07:33:09,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:33:09,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:33:09,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 561 proven. 31 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2018-11-10 07:33:09,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:33:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 161 proven. 256 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2018-11-10 07:33:10,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:33:10,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 16 [2018-11-10 07:33:10,034 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:33:10,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 07:33:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 07:33:10,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:33:10,034 INFO L87 Difference]: Start difference. First operand 470 states and 610 transitions. Second operand 12 states. [2018-11-10 07:33:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:10,197 INFO L93 Difference]: Finished difference Result 793 states and 1062 transitions. [2018-11-10 07:33:10,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 07:33:10,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 171 [2018-11-10 07:33:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:33:10,200 INFO L225 Difference]: With dead ends: 793 [2018-11-10 07:33:10,200 INFO L226 Difference]: Without dead ends: 431 [2018-11-10 07:33:10,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 331 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2018-11-10 07:33:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-11-10 07:33:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-11-10 07:33:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-11-10 07:33:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 532 transitions. [2018-11-10 07:33:10,229 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 532 transitions. Word has length 171 [2018-11-10 07:33:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:33:10,229 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 532 transitions. [2018-11-10 07:33:10,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 07:33:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 532 transitions. [2018-11-10 07:33:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 07:33:10,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:33:10,232 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 13, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:10,232 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:33:10,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:10,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1185046691, now seen corresponding path program 1 times [2018-11-10 07:33:10,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:33:10,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:10,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:33:10,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:10,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:33:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 76 proven. 189 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-11-10 07:33:10,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:10,330 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:33:10,331 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 153 with the following transitions: [2018-11-10 07:33:10,331 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [22], [23], [24], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-11-10 07:33:10,332 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:33:10,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:33:12,282 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:33:12,282 INFO L272 AbstractInterpreter]: Visited 25 different actions 10255 times. Merged at 10 different actions 2760 times. Never widened. Found 730 fixpoints after 5 different actions. Largest state had 5 variables. [2018-11-10 07:33:12,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:12,286 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:33:12,356 INFO L227 lantSequenceWeakener]: Weakened 103 states. On average, predicates are now at 44.58% of their original sizes. [2018-11-10 07:33:12,356 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:33:12,987 INFO L415 sIntCurrentIteration]: We unified 151 AI predicates to 151 [2018-11-10 07:33:12,987 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:33:12,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:33:12,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [12] total 57 [2018-11-10 07:33:12,987 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:33:12,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-10 07:33:12,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-10 07:33:12,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1720, Unknown=0, NotChecked=0, Total=2070 [2018-11-10 07:33:12,989 INFO L87 Difference]: Start difference. First operand 431 states and 532 transitions. Second operand 46 states. [2018-11-10 07:33:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:14,125 INFO L93 Difference]: Finished difference Result 451 states and 569 transitions. [2018-11-10 07:33:14,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 07:33:14,125 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 152 [2018-11-10 07:33:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:33:14,126 INFO L225 Difference]: With dead ends: 451 [2018-11-10 07:33:14,126 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:33:14,128 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=662, Invalid=2998, Unknown=0, NotChecked=0, Total=3660 [2018-11-10 07:33:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:33:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:33:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:33:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:33:14,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 152 [2018-11-10 07:33:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:33:14,129 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:33:14,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-10 07:33:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:33:14,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:33:14,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:33:14,436 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 26 [2018-11-10 07:33:14,530 INFO L425 ceAbstractionStarter]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,530 INFO L425 ceAbstractionStarter]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,530 INFO L425 ceAbstractionStarter]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,530 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-11-10 07:33:14,530 INFO L425 ceAbstractionStarter]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2018-11-10 07:33:14,531 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 23) no Hoare annotation was computed. [2018-11-10 07:33:14,531 INFO L425 ceAbstractionStarter]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,531 INFO L425 ceAbstractionStarter]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,531 INFO L425 ceAbstractionStarter]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,531 INFO L425 ceAbstractionStarter]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2018-11-10 07:33:14,531 INFO L428 ceAbstractionStarter]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2018-11-10 07:33:14,531 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,531 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,531 INFO L421 ceAbstractionStarter]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (* 2 |fibonacci_#in~n|))) (and (or (< 4294967284 .cse0) (< .cse0 0) (<= 2 fibonacci_~n)) (or (< (+ .cse0 4294967296) 0) (and (<= |fibonacci_#in~n| fibonacci_~n) (<= 1 fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) (< 2147483647 |fibonacci_#in~n|)))) [2018-11-10 07:33:14,531 INFO L425 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,531 INFO L425 ceAbstractionStarter]: For program point L22-4(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,532 INFO L425 ceAbstractionStarter]: For program point L22-5(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,532 INFO L421 ceAbstractionStarter]: At program point L22-6(line 22) the Hoare annotation is: (or (< (+ (* 2 |fibonacci_#in~n|) 4294967296) 0) (< 2147483647 |fibonacci_#in~n|)) [2018-11-10 07:33:14,532 INFO L425 ceAbstractionStarter]: For program point L22-7(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,532 INFO L425 ceAbstractionStarter]: For program point L22-8(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,532 INFO L425 ceAbstractionStarter]: For program point L22-9(line 22) no Hoare annotation was computed. [2018-11-10 07:33:14,532 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:33:14,532 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:33:14,532 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:33:14,532 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:33:14,532 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:33:14,532 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:33:14,532 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-10 07:33:14,532 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 34) no Hoare annotation was computed. [2018-11-10 07:33:14,532 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 27 35) the Hoare annotation is: true [2018-11-10 07:33:14,532 INFO L421 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (* 2 main_~x~0))) (and (<= 0 (+ .cse0 4294967296)) (<= .cse0 4294967294))) [2018-11-10 07:33:14,533 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 27 35) no Hoare annotation was computed. [2018-11-10 07:33:14,533 INFO L425 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-11-10 07:33:14,533 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 27 35) no Hoare annotation was computed. [2018-11-10 07:33:14,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:33:14 BoogieIcfgContainer [2018-11-10 07:33:14,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:33:14,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:33:14,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:33:14,535 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:33:14,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:32:55" (3/4) ... [2018-11-10 07:33:14,538 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:33:14,543 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2018-11-10 07:33:14,543 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:33:14,543 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:33:14,546 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-10 07:33:14,547 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 07:33:14,547 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:33:14,582 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_103b2094-57ae-4dea-a21d-12a41355940f/bin-2019/utaipan/witness.graphml [2018-11-10 07:33:14,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:33:14,582 INFO L168 Benchmark]: Toolchain (without parser) took 19846.41 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 911.2 MB). Free memory was 953.8 MB in the beginning and 1.0 GB in the end (delta: -92.1 MB). Peak memory consumption was 819.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:33:14,583 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:33:14,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.45 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:33:14,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 10.77 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 942.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:33:14,584 INFO L168 Benchmark]: Boogie Preprocessor took 9.55 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:33:14,584 INFO L168 Benchmark]: RCFGBuilder took 168.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -217.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:33:14,584 INFO L168 Benchmark]: TraceAbstraction took 19468.38 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 740.8 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 111.0 MB). Peak memory consumption was 851.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:33:14,584 INFO L168 Benchmark]: Witness Printer took 46.69 ms. Allocated memory is still 1.9 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:33:14,586 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.45 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 10.77 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 942.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.55 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 168.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -217.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19468.38 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 740.8 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 111.0 MB). Peak memory consumption was 851.8 MB. Max. memory is 11.5 GB. * Witness Printer took 46.69 ms. Allocated memory is still 1.9 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. SAFE Result, 19.4s OverallTime, 12 OverallIterations, 18 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 285 SDtfs, 1575 SDslu, 1096 SDs, 0 SdLazy, 2012 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1648 GetRequests, 1249 SyntacticMatches, 70 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4503 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.9286274509803933 AbsIntWeakeningRatio, 0.40784313725490196 AbsIntAvgWeakeningVarsNumRemoved, 3.5176470588235293 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 659 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 494 PreInvPairs, 512 NumberOfFragments, 71 HoareAnnotationTreeSize, 494 FomulaSimplifications, 2053 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 2151 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1467 NumberOfCodeBlocks, 1348 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2025 ConstructedInterpolants, 0 QuantifiedInterpolants, 501392 SizeOfPredicates, 22 NumberOfNonLiveVariables, 919 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 5957/7774 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...