./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/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 7e40a98558d0111ea95f3ee60a44cc14c7768182 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 15:47:44,767 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 15:47:44,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 15:47:44,774 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 15:47:44,774 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 15:47:44,775 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 15:47:44,775 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 15:47:44,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 15:47:44,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 15:47:44,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 15:47:44,779 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 15:47:44,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 15:47:44,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 15:47:44,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 15:47:44,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 15:47:44,782 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 15:47:44,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 15:47:44,784 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 15:47:44,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 15:47:44,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 15:47:44,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 15:47:44,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 15:47:44,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 15:47:44,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 15:47:44,790 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 15:47:44,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 15:47:44,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 15:47:44,791 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 15:47:44,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 15:47:44,792 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 15:47:44,793 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 15:47:44,793 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 15:47:44,793 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 15:47:44,793 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 15:47:44,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 15:47:44,794 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 15:47:44,794 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-12-08 15:47:44,801 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 15:47:44,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 15:47:44,801 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 15:47:44,802 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 15:47:44,802 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 15:47:44,802 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 15:47:44,802 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 15:47:44,802 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 15:47:44,802 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 15:47:44,802 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 15:47:44,802 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 15:47:44,802 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 15:47:44,802 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 15:47:44,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 15:47:44,803 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 15:47:44,803 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 15:47:44,803 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 15:47:44,803 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 15:47:44,803 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 15:47:44,803 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 15:47:44,803 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 15:47:44,803 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 15:47:44,803 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-08 15:47:44,804 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 15:47:44,804 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 15:47:44,804 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 15:47:44,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 15:47:44,804 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 15:47:44,804 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 15:47:44,804 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 15:47:44,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 15:47:44,804 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 15:47:44,804 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 15:47:44,804 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 15:47:44,804 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 15:47:44,805 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 15:47:44,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 15:47:44,805 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 15:47:44,805 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_73cff9cc-2c36-4609-b827-8f401b52cdf4/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 -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2018-12-08 15:47:44,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 15:47:44,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 15:47:44,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 15:47:44,835 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 15:47:44,835 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 15:47:44,836 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-08 15:47:44,881 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/data/1819f880d/a97067d4d4b24b7eaa1957f78a5b1214/FLAGf1b7fc421 [2018-12-08 15:47:45,310 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 15:47:45,310 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-08 15:47:45,314 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/data/1819f880d/a97067d4d4b24b7eaa1957f78a5b1214/FLAGf1b7fc421 [2018-12-08 15:47:45,322 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/data/1819f880d/a97067d4d4b24b7eaa1957f78a5b1214 [2018-12-08 15:47:45,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 15:47:45,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 15:47:45,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 15:47:45,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 15:47:45,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 15:47:45,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:47:45" (1/1) ... [2018-12-08 15:47:45,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45, skipping insertion in model container [2018-12-08 15:47:45,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:47:45" (1/1) ... [2018-12-08 15:47:45,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 15:47:45,342 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 15:47:45,421 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:47:45,423 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 15:47:45,431 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:47:45,439 INFO L195 MainTranslator]: Completed translation [2018-12-08 15:47:45,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45 WrapperNode [2018-12-08 15:47:45,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 15:47:45,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 15:47:45,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 15:47:45,440 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 15:47:45,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45" (1/1) ... [2018-12-08 15:47:45,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45" (1/1) ... [2018-12-08 15:47:45,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 15:47:45,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 15:47:45,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 15:47:45,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 15:47:45,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45" (1/1) ... [2018-12-08 15:47:45,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45" (1/1) ... [2018-12-08 15:47:45,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45" (1/1) ... [2018-12-08 15:47:45,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45" (1/1) ... [2018-12-08 15:47:45,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45" (1/1) ... [2018-12-08 15:47:45,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45" (1/1) ... [2018-12-08 15:47:45,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45" (1/1) ... [2018-12-08 15:47:45,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 15:47:45,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 15:47:45,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 15:47:45,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 15:47:45,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/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-12-08 15:47:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-12-08 15:47:45,526 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-12-08 15:47:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 15:47:45,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 15:47:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 15:47:45,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 15:47:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 15:47:45,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 15:47:45,621 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 15:47:45,621 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 15:47:45,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:47:45 BoogieIcfgContainer [2018-12-08 15:47:45,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 15:47:45,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 15:47:45,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 15:47:45,624 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 15:47:45,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 03:47:45" (1/3) ... [2018-12-08 15:47:45,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f84be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:47:45, skipping insertion in model container [2018-12-08 15:47:45,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:45" (2/3) ... [2018-12-08 15:47:45,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f84be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:47:45, skipping insertion in model container [2018-12-08 15:47:45,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:47:45" (3/3) ... [2018-12-08 15:47:45,626 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-08 15:47:45,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 15:47:45,638 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-12-08 15:47:45,648 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-12-08 15:47:45,670 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 15:47:45,671 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 15:47:45,671 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 15:47:45,671 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 15:47:45,671 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 15:47:45,671 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 15:47:45,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 15:47:45,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 15:47:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-12-08 15:47:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 15:47:45,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:45,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:45,688 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:47:45,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:45,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1707029017, now seen corresponding path program 1 times [2018-12-08 15:47:45,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:45,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:45,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:45,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:45,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:47:45,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:45,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:47:45,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:45,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 15:47:45,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:47:45,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 15:47:45,806 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2018-12-08 15:47:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:45,865 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-08 15:47:45,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:47:45,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-08 15:47:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:45,871 INFO L225 Difference]: With dead ends: 38 [2018-12-08 15:47:45,871 INFO L226 Difference]: Without dead ends: 25 [2018-12-08 15:47:45,873 INFO L631 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-12-08 15:47:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-08 15:47:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-08 15:47:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-08 15:47:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-08 15:47:45,896 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 10 [2018-12-08 15:47:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:45,896 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-08 15:47:45,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 15:47:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-08 15:47:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 15:47:45,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:45,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:45,898 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:47:45,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:45,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1378291933, now seen corresponding path program 1 times [2018-12-08 15:47:45,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:45,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:45,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:45,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:45,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:47:45,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:45,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 15:47:45,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:45,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 15:47:45,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 15:47:45,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:47:45,911 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-12-08 15:47:45,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:45,921 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-12-08 15:47:45,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 15:47:45,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-08 15:47:45,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:45,923 INFO L225 Difference]: With dead ends: 27 [2018-12-08 15:47:45,923 INFO L226 Difference]: Without dead ends: 25 [2018-12-08 15:47:45,924 INFO L631 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-12-08 15:47:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-08 15:47:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-08 15:47:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 15:47:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-08 15:47:45,928 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 11 [2018-12-08 15:47:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:45,928 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-08 15:47:45,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 15:47:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-12-08 15:47:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 15:47:45,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:45,929 INFO L402 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-12-08 15:47:45,929 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:47:45,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:45,929 INFO L82 PathProgramCache]: Analyzing trace with hash -995069271, now seen corresponding path program 1 times [2018-12-08 15:47:45,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:45,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:45,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 15:47:45,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:45,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:47:45,972 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-08 15:47:45,973 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [14], [16], [18], [20], [21], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-12-08 15:47:45,994 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:47:45,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:47:46,185 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 15:47:46,186 INFO L272 AbstractInterpreter]: Visited 22 different actions 405 times. Never merged. Widened at 2 different actions 25 times. Performed 807 root evaluator evaluations with a maximum evaluation depth of 4. Performed 807 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 20 fixpoints after 2 different actions. Largest state had 5 variables. [2018-12-08 15:47:46,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:46,190 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 15:47:46,217 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-12-08 15:47:46,217 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 15:47:46,245 INFO L418 sIntCurrentIteration]: We unified 31 AI predicates to 31 [2018-12-08 15:47:46,245 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 15:47:46,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:47:46,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-08 15:47:46,246 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:46,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 15:47:46,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 15:47:46,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 15:47:46,247 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 9 states. [2018-12-08 15:47:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:46,505 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2018-12-08 15:47:46,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 15:47:46,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-08 15:47:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:46,507 INFO L225 Difference]: With dead ends: 91 [2018-12-08 15:47:46,507 INFO L226 Difference]: Without dead ends: 72 [2018-12-08 15:47:46,508 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-08 15:47:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-08 15:47:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2018-12-08 15:47:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-08 15:47:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-12-08 15:47:46,517 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 32 [2018-12-08 15:47:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:46,517 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-12-08 15:47:46,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 15:47:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-12-08 15:47:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 15:47:46,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:46,518 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:46,518 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:47:46,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:46,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1617198389, now seen corresponding path program 2 times [2018-12-08 15:47:46,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:46,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:46,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:46,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:46,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 15:47:46,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:46,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:47:46,561 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:47:46,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:47:46,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:46,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/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-12-08 15:47:46,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:47:46,570 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:47:46,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-08 15:47:46,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:47:46,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:47:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 15:47:46,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:47:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 15:47:46,674 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:47:46,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2018-12-08 15:47:46,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:46,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 15:47:46,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:47:46,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 15:47:46,675 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 5 states. [2018-12-08 15:47:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:46,692 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2018-12-08 15:47:46,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:47:46,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-08 15:47:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:46,694 INFO L225 Difference]: With dead ends: 81 [2018-12-08 15:47:46,694 INFO L226 Difference]: Without dead ends: 80 [2018-12-08 15:47:46,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 15:47:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-08 15:47:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-12-08 15:47:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 15:47:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2018-12-08 15:47:46,701 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 38 [2018-12-08 15:47:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:46,701 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2018-12-08 15:47:46,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 15:47:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2018-12-08 15:47:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 15:47:46,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:46,702 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:46,702 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:47:46,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:46,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1406457547, now seen corresponding path program 1 times [2018-12-08 15:47:46,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:46,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:46,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:47:46,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:46,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 15:47:46,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:46,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:47:46,738 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-08 15:47:46,738 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [14], [16], [18], [20], [22], [23], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-12-08 15:47:46,739 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:47:46,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:47:46,807 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 15:47:46,807 INFO L272 AbstractInterpreter]: Visited 23 different actions 415 times. Never merged. Widened at 2 different actions 25 times. Performed 827 root evaluator evaluations with a maximum evaluation depth of 4. Performed 827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 20 fixpoints after 2 different actions. Largest state had 5 variables. [2018-12-08 15:47:46,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:46,812 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 15:47:46,825 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 50% of their original sizes. [2018-12-08 15:47:46,825 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 15:47:46,871 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-08 15:47:46,871 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 15:47:46,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:47:46,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-12-08 15:47:46,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:46,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 15:47:46,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 15:47:46,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 15:47:46,872 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 11 states. [2018-12-08 15:47:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:47,285 INFO L93 Difference]: Finished difference Result 153 states and 187 transitions. [2018-12-08 15:47:47,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 15:47:47,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-12-08 15:47:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:47,286 INFO L225 Difference]: With dead ends: 153 [2018-12-08 15:47:47,286 INFO L226 Difference]: Without dead ends: 97 [2018-12-08 15:47:47,287 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-08 15:47:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-08 15:47:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-12-08 15:47:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-08 15:47:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2018-12-08 15:47:47,294 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 39 [2018-12-08 15:47:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:47,295 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2018-12-08 15:47:47,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 15:47:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2018-12-08 15:47:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 15:47:47,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:47,295 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:47,296 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:47:47,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1228913769, now seen corresponding path program 2 times [2018-12-08 15:47:47,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:47,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:47,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-08 15:47:47,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:47,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:47:47,343 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:47:47,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:47:47,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:47,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/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-12-08 15:47:47,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:47:47,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:47:47,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-08 15:47:47,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:47:47,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:47:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-08 15:47:47,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:47:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-08 15:47:47,412 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:47:47,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2018-12-08 15:47:47,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:47,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 15:47:47,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:47:47,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 15:47:47,412 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 5 states. [2018-12-08 15:47:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:47,427 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2018-12-08 15:47:47,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:47:47,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-08 15:47:47,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:47,427 INFO L225 Difference]: With dead ends: 104 [2018-12-08 15:47:47,428 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 15:47:47,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 15:47:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 15:47:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-12-08 15:47:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 15:47:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2018-12-08 15:47:47,434 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 45 [2018-12-08 15:47:47,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:47,434 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2018-12-08 15:47:47,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 15:47:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2018-12-08 15:47:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 15:47:47,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:47,435 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:47,435 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:47:47,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:47,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1240405343, now seen corresponding path program 1 times [2018-12-08 15:47:47,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:47,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:47,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:47:47,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:47,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-08 15:47:47,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:47,470 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:47:47,470 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-08 15:47:47,470 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [21], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-12-08 15:47:47,471 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:47:47,471 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:47:47,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:47:47,812 INFO L272 AbstractInterpreter]: Visited 23 different actions 2706 times. Merged at 9 different actions 767 times. Widened at 2 different actions 134 times. Performed 6647 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6647 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 179 fixpoints after 3 different actions. Largest state had 5 variables. [2018-12-08 15:47:47,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:47,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:47:47,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:47,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/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-12-08 15:47:47,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:47,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:47:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:47,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:47:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:47:47,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:47:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 15:47:48,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:47:48,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 24 [2018-12-08 15:47:48,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:47:48,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 15:47:48,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 15:47:48,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2018-12-08 15:47:48,010 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand 15 states. [2018-12-08 15:47:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:48,191 INFO L93 Difference]: Finished difference Result 186 states and 238 transitions. [2018-12-08 15:47:48,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 15:47:48,191 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-12-08 15:47:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:48,192 INFO L225 Difference]: With dead ends: 186 [2018-12-08 15:47:48,192 INFO L226 Difference]: Without dead ends: 104 [2018-12-08 15:47:48,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2018-12-08 15:47:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-08 15:47:48,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-12-08 15:47:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 15:47:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2018-12-08 15:47:48,198 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 45 [2018-12-08 15:47:48,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:48,199 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2018-12-08 15:47:48,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 15:47:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2018-12-08 15:47:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 15:47:48,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:48,199 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:48,200 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:47:48,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:48,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1942973709, now seen corresponding path program 1 times [2018-12-08 15:47:48,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:48,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:48,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:48,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:48,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-08 15:47:48,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:48,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:47:48,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:48,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 15:47:48,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:47:48,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 15:47:48,232 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand 5 states. [2018-12-08 15:47:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:48,258 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2018-12-08 15:47:48,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:47:48,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-08 15:47:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:48,259 INFO L225 Difference]: With dead ends: 121 [2018-12-08 15:47:48,259 INFO L226 Difference]: Without dead ends: 120 [2018-12-08 15:47:48,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:47:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-08 15:47:48,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2018-12-08 15:47:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-08 15:47:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2018-12-08 15:47:48,265 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 46 [2018-12-08 15:47:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:48,265 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2018-12-08 15:47:48,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 15:47:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2018-12-08 15:47:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 15:47:48,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:48,267 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:48,267 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:47:48,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1616531980, now seen corresponding path program 1 times [2018-12-08 15:47:48,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:48,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:48,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:48,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:48,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 34 proven. 18 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-08 15:47:48,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:48,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:47:48,315 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-12-08 15:47:48,316 INFO L205 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-12-08 15:47:48,316 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:47:48,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:48:03,596 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:48:03,596 INFO L272 AbstractInterpreter]: Visited 25 different actions 189769 times. Merged at 11 different actions 64643 times. Widened at 2 different actions 7475 times. Performed 485011 root evaluator evaluations with a maximum evaluation depth of 4. Performed 485011 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17153 fixpoints after 6 different actions. Largest state had 5 variables. [2018-12-08 15:48:03,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:03,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:48:03,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:03,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/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-12-08 15:48:03,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:03,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:48:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:03,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 58 proven. 48 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:48:03,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 2 proven. 107 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 15:48:03,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:03,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 24 [2018-12-08 15:48:03,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:03,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 15:48:03,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 15:48:03,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-12-08 15:48:03,843 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand 16 states. [2018-12-08 15:48:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:04,051 INFO L93 Difference]: Finished difference Result 200 states and 257 transitions. [2018-12-08 15:48:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 15:48:04,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2018-12-08 15:48:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:04,052 INFO L225 Difference]: With dead ends: 200 [2018-12-08 15:48:04,052 INFO L226 Difference]: Without dead ends: 111 [2018-12-08 15:48:04,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2018-12-08 15:48:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-08 15:48:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2018-12-08 15:48:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-08 15:48:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2018-12-08 15:48:04,057 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 65 [2018-12-08 15:48:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:04,058 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-12-08 15:48:04,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 15:48:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-12-08 15:48:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 15:48:04,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:04,058 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:04,058 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:48:04,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash 399082410, now seen corresponding path program 2 times [2018-12-08 15:48:04,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:04,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:04,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-08 15:48:04,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:04,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:04,096 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:48:04,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:48:04,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:04,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/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-12-08 15:48:04,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:48:04,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:48:04,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 15:48:04,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:04,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-08 15:48:04,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-12-08 15:48:04,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:04,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2018-12-08 15:48:04,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:04,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 15:48:04,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 15:48:04,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-08 15:48:04,234 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand 9 states. [2018-12-08 15:48:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:04,274 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2018-12-08 15:48:04,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 15:48:04,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2018-12-08 15:48:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:04,275 INFO L225 Difference]: With dead ends: 135 [2018-12-08 15:48:04,275 INFO L226 Difference]: Without dead ends: 134 [2018-12-08 15:48:04,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-08 15:48:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-08 15:48:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2018-12-08 15:48:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-08 15:48:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 150 transitions. [2018-12-08 15:48:04,281 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 150 transitions. Word has length 71 [2018-12-08 15:48:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:04,281 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 150 transitions. [2018-12-08 15:48:04,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 15:48:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 150 transitions. [2018-12-08 15:48:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 15:48:04,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:04,283 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:04,283 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:48:04,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:04,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1586791492, now seen corresponding path program 3 times [2018-12-08 15:48:04,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:04,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:04,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:04,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:04,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 135 proven. 92 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-08 15:48:04,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:04,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:04,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:48:04,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:48:04,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:04,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:48:04,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 15:48:04,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-08 15:48:04,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 15:48:04,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:04,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 216 proven. 162 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-08 15:48:04,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 12 proven. 350 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-08 15:48:04,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:04,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 19] total 24 [2018-12-08 15:48:04,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:04,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-08 15:48:04,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-08 15:48:04,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-12-08 15:48:04,647 INFO L87 Difference]: Start difference. First operand 120 states and 150 transitions. Second operand 22 states. [2018-12-08 15:48:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:05,143 INFO L93 Difference]: Finished difference Result 384 states and 661 transitions. [2018-12-08 15:48:05,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 15:48:05,144 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 116 [2018-12-08 15:48:05,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:05,146 INFO L225 Difference]: With dead ends: 384 [2018-12-08 15:48:05,146 INFO L226 Difference]: Without dead ends: 282 [2018-12-08 15:48:05,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 212 SyntacticMatches, 17 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2018-12-08 15:48:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-08 15:48:05,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 243. [2018-12-08 15:48:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-08 15:48:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 383 transitions. [2018-12-08 15:48:05,163 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 383 transitions. Word has length 116 [2018-12-08 15:48:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:05,164 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 383 transitions. [2018-12-08 15:48:05,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-08 15:48:05,164 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 383 transitions. [2018-12-08 15:48:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-08 15:48:05,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:05,165 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 10, 10, 10, 10, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:05,165 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:48:05,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:05,165 INFO L82 PathProgramCache]: Analyzing trace with hash -230294793, now seen corresponding path program 4 times [2018-12-08 15:48:05,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:05,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:05,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:05,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:05,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 195 proven. 198 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-08 15:48:05,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:05,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:05,352 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:48:05,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:48:05,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:05,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:48:05,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:05,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:48:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:05,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 243 proven. 170 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-08 15:48:05,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 195 proven. 198 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-08 15:48:05,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:05,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 27 [2018-12-08 15:48:05,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:05,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-08 15:48:05,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-08 15:48:05,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2018-12-08 15:48:05,615 INFO L87 Difference]: Start difference. First operand 243 states and 383 transitions. Second operand 25 states. [2018-12-08 15:48:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:06,054 INFO L93 Difference]: Finished difference Result 393 states and 614 transitions. [2018-12-08 15:48:06,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-08 15:48:06,054 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 109 [2018-12-08 15:48:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:06,055 INFO L225 Difference]: With dead ends: 393 [2018-12-08 15:48:06,055 INFO L226 Difference]: Without dead ends: 159 [2018-12-08 15:48:06,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 201 SyntacticMatches, 20 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=720, Invalid=1830, Unknown=0, NotChecked=0, Total=2550 [2018-12-08 15:48:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-08 15:48:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2018-12-08 15:48:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-08 15:48:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2018-12-08 15:48:06,066 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 109 [2018-12-08 15:48:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:06,066 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2018-12-08 15:48:06,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-08 15:48:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2018-12-08 15:48:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 15:48:06,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:06,067 INFO L402 BasicCegarLoop]: trace histogram [14, 11, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:06,068 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:48:06,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1611838702, now seen corresponding path program 1 times [2018-12-08 15:48:06,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:06,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:06,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 77 proven. 57 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-12-08 15:48:06,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:06,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:06,145 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2018-12-08 15:48:06,145 INFO L205 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-12-08 15:48:06,146 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:48:06,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:48:18,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:48:18,914 INFO L272 AbstractInterpreter]: Visited 25 different actions 189857 times. Merged at 11 different actions 64731 times. Widened at 2 different actions 7475 times. Performed 485427 root evaluator evaluations with a maximum evaluation depth of 4. Performed 485427 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17153 fixpoints after 6 different actions. Largest state had 5 variables. [2018-12-08 15:48:18,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:18,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:48:18,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:18,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:48:18,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:18,922 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:48:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:18,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 188 proven. 214 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-08 15:48:19,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 39 proven. 315 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-08 15:48:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:19,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 19] total 25 [2018-12-08 15:48:19,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:19,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-08 15:48:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-08 15:48:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2018-12-08 15:48:19,212 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand 23 states. [2018-12-08 15:48:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:19,490 INFO L93 Difference]: Finished difference Result 279 states and 318 transitions. [2018-12-08 15:48:19,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 15:48:19,490 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 116 [2018-12-08 15:48:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:19,491 INFO L225 Difference]: With dead ends: 279 [2018-12-08 15:48:19,491 INFO L226 Difference]: Without dead ends: 148 [2018-12-08 15:48:19,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 206 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2018-12-08 15:48:19,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-08 15:48:19,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2018-12-08 15:48:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-08 15:48:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-12-08 15:48:19,498 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 116 [2018-12-08 15:48:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:19,498 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-12-08 15:48:19,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-08 15:48:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-12-08 15:48:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 15:48:19,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:19,499 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:19,500 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:48:19,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:19,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1128501564, now seen corresponding path program 5 times [2018-12-08 15:48:19,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:19,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:19,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:19,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:19,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-12-08 15:48:19,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:19,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:19,562 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:48:19,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:48:19,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:19,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:48:19,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:48:19,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:48:19,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-08 15:48:19,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:19,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-12-08 15:48:19,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 46 proven. 35 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-12-08 15:48:19,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:19,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 19 [2018-12-08 15:48:19,860 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:19,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 15:48:19,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 15:48:19,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-12-08 15:48:19,861 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 13 states. [2018-12-08 15:48:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:19,896 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2018-12-08 15:48:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 15:48:19,896 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2018-12-08 15:48:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:19,897 INFO L225 Difference]: With dead ends: 140 [2018-12-08 15:48:19,897 INFO L226 Difference]: Without dead ends: 139 [2018-12-08 15:48:19,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 223 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2018-12-08 15:48:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-08 15:48:19,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-12-08 15:48:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-08 15:48:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2018-12-08 15:48:19,903 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 116 [2018-12-08 15:48:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:19,903 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2018-12-08 15:48:19,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 15:48:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2018-12-08 15:48:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 15:48:19,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:19,905 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:19,905 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:48:19,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash -623810062, now seen corresponding path program 2 times [2018-12-08 15:48:19,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:19,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:19,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-12-08 15:48:19,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:19,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:19,957 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:48:19,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:48:19,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:19,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:48:19,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:48:19,964 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:48:19,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-08 15:48:19,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:19,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-12-08 15:48:20,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-12-08 15:48:20,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:20,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-12-08 15:48:20,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:20,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 15:48:20,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 15:48:20,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-08 15:48:20,094 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand 10 states. [2018-12-08 15:48:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:20,117 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2018-12-08 15:48:20,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:48:20,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 117 [2018-12-08 15:48:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:20,118 INFO L225 Difference]: With dead ends: 138 [2018-12-08 15:48:20,118 INFO L226 Difference]: Without dead ends: 136 [2018-12-08 15:48:20,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 226 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-12-08 15:48:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-08 15:48:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-08 15:48:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-08 15:48:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2018-12-08 15:48:20,124 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 117 [2018-12-08 15:48:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:20,124 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2018-12-08 15:48:20,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 15:48:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2018-12-08 15:48:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-08 15:48:20,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:20,125 INFO L402 BasicCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:20,125 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:48:20,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1226786477, now seen corresponding path program 6 times [2018-12-08 15:48:20,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:20,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:20,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:20,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:20,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-12-08 15:48:20,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:20,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:20,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:48:20,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:48:20,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:20,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:48:20,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 15:48:20,206 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-08 15:48:20,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 15:48:20,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:20,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-12-08 15:48:20,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 144 proven. 122 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-12-08 15:48:20,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:20,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2018-12-08 15:48:20,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:20,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 15:48:20,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 15:48:20,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-12-08 15:48:20,830 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand 17 states. [2018-12-08 15:48:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:20,862 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-12-08 15:48:20,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 15:48:20,862 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 169 [2018-12-08 15:48:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:20,863 INFO L225 Difference]: With dead ends: 137 [2018-12-08 15:48:20,863 INFO L226 Difference]: Without dead ends: 136 [2018-12-08 15:48:20,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 325 SyntacticMatches, 16 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-12-08 15:48:20,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-08 15:48:20,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-08 15:48:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-08 15:48:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-12-08 15:48:20,867 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 169 [2018-12-08 15:48:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:20,867 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-12-08 15:48:20,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 15:48:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-12-08 15:48:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-08 15:48:20,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:20,870 INFO L402 BasicCegarLoop]: trace histogram [28, 24, 23, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 11, 11, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:20,870 INFO L423 AbstractCegarLoop]: === Iteration 17 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:48:20,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:20,871 INFO L82 PathProgramCache]: Analyzing trace with hash -333231388, now seen corresponding path program 7 times [2018-12-08 15:48:20,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:20,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:20,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:20,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:20,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2018-12-08 15:48:20,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:20,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:20,991 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:48:20,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:48:20,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:20,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:48:20,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:20,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:48:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:21,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2018-12-08 15:48:21,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 429 proven. 355 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2018-12-08 15:48:22,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:22,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 23] total 33 [2018-12-08 15:48:22,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:22,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 15:48:22,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 15:48:22,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 15:48:22,408 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 21 states. [2018-12-08 15:48:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:22,459 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-12-08 15:48:22,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 15:48:22,459 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 261 [2018-12-08 15:48:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:22,460 INFO L225 Difference]: With dead ends: 137 [2018-12-08 15:48:22,460 INFO L226 Difference]: Without dead ends: 136 [2018-12-08 15:48:22,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 505 SyntacticMatches, 33 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 15:48:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-08 15:48:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-08 15:48:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-08 15:48:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2018-12-08 15:48:22,465 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 261 [2018-12-08 15:48:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:22,465 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2018-12-08 15:48:22,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 15:48:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2018-12-08 15:48:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-12-08 15:48:22,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:22,467 INFO L402 BasicCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 19, 19, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:22,467 INFO L423 AbstractCegarLoop]: === Iteration 18 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:48:22,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:22,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1881532310, now seen corresponding path program 8 times [2018-12-08 15:48:22,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:22,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:22,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:22,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:22,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2018-12-08 15:48:22,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:22,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:22,840 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:48:22,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:48:22,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:22,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:48:22,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:48:22,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:48:22,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-08 15:48:22,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:22,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2018-12-08 15:48:23,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 1149 proven. 996 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2018-12-08 15:48:26,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:26,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2018-12-08 15:48:26,169 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:26,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-08 15:48:26,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-08 15:48:26,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2018-12-08 15:48:26,170 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand 25 states. [2018-12-08 15:48:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:26,241 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-12-08 15:48:26,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 15:48:26,241 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 412 [2018-12-08 15:48:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:26,242 INFO L225 Difference]: With dead ends: 137 [2018-12-08 15:48:26,242 INFO L226 Difference]: Without dead ends: 136 [2018-12-08 15:48:26,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 803 SyntacticMatches, 62 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2018-12-08 15:48:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-08 15:48:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-08 15:48:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-08 15:48:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-12-08 15:48:26,246 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 412 [2018-12-08 15:48:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:26,247 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-12-08 15:48:26,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-08 15:48:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-12-08 15:48:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2018-12-08 15:48:26,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:26,249 INFO L402 BasicCegarLoop]: trace histogram [68, 66, 55, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 32, 32, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:26,250 INFO L423 AbstractCegarLoop]: === Iteration 19 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:48:26,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:26,250 INFO L82 PathProgramCache]: Analyzing trace with hash 355145621, now seen corresponding path program 9 times [2018-12-08 15:48:26,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:26,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:26,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2018-12-08 15:48:26,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:26,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:26,602 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:48:26,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:48:26,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:26,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:48:26,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 15:48:26,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-08 15:48:26,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 15:48:26,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:26,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2018-12-08 15:48:26,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:30,116 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-08 15:48:30,242 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-08 15:48:31,069 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-08 15:48:31,269 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-08 15:48:31,475 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-08 15:48:31,681 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-08 15:48:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 3029 proven. 2721 refuted. 0 times theorem prover too weak. 9928 trivial. 0 not checked. [2018-12-08 15:48:35,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:35,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 35] total 47 [2018-12-08 15:48:35,005 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:35,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-08 15:48:35,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-08 15:48:35,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1761, Unknown=0, NotChecked=0, Total=2256 [2018-12-08 15:48:35,006 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 29 states. [2018-12-08 15:48:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:35,078 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-12-08 15:48:35,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 15:48:35,078 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 661 [2018-12-08 15:48:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:35,079 INFO L225 Difference]: With dead ends: 137 [2018-12-08 15:48:35,079 INFO L226 Difference]: Without dead ends: 136 [2018-12-08 15:48:35,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1454 GetRequests, 1297 SyntacticMatches, 111 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2975 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=495, Invalid=1761, Unknown=0, NotChecked=0, Total=2256 [2018-12-08 15:48:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-08 15:48:35,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-08 15:48:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-08 15:48:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2018-12-08 15:48:35,084 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 661 [2018-12-08 15:48:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:35,084 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-12-08 15:48:35,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-08 15:48:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-12-08 15:48:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2018-12-08 15:48:35,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:35,089 INFO L402 BasicCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:35,089 INFO L423 AbstractCegarLoop]: === Iteration 20 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 15:48:35,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:35,090 INFO L82 PathProgramCache]: Analyzing trace with hash -642383590, now seen corresponding path program 10 times [2018-12-08 15:48:35,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:35,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:35,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:35,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:35,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2018-12-08 15:48:35,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:35,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:35,759 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:48:35,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:48:35,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:35,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:48:35,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:35,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:48:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:35,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2018-12-08 15:48:36,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:37,304 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-08 15:48:37,984 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-08 15:48:38,189 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-08 15:48:38,398 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-08 15:48:38,605 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-08 15:48:43,286 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-08 15:48:43,487 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-08 15:48:43,699 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-08 15:48:43,918 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-08 15:48:45,423 WARN L180 SmtUtils]: Spent 521.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-12-08 15:48:45,922 WARN L180 SmtUtils]: Spent 495.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-12-08 15:48:46,434 WARN L180 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-12-08 15:48:46,931 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-12-08 15:48:47,827 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-08 15:48:47,960 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-08 15:48:48,113 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-08 15:48:48,275 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-08 15:48:52,321 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-08 15:48:52,539 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-08 15:48:52,765 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-08 15:48:52,991 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-08 15:48:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 7863 proven. 7339 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2018-12-08 15:48:56,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:56,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 41] total 54 [2018-12-08 15:48:56,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:56,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-08 15:48:56,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-08 15:48:56,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2018-12-08 15:48:56,651 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 33 states. [2018-12-08 15:48:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:56,731 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-12-08 15:48:56,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 15:48:56,731 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1067 [2018-12-08 15:48:56,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:56,732 INFO L225 Difference]: With dead ends: 136 [2018-12-08 15:48:56,732 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 15:48:56,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2350 GetRequests, 2105 SyntacticMatches, 192 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5331 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2018-12-08 15:48:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 15:48:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 15:48:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 15:48:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 15:48:56,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1067 [2018-12-08 15:48:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:56,733 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 15:48:56,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-08 15:48:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 15:48:56,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 15:48:56,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 15:48:57,112 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 51 [2018-12-08 15:48:57,249 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 46 [2018-12-08 15:48:57,250 INFO L448 ceAbstractionStarter]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,250 INFO L448 ceAbstractionStarter]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,250 INFO L448 ceAbstractionStarter]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,250 INFO L448 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2018-12-08 15:48:57,250 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2018-12-08 15:48:57,250 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L451 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (<= fibonacci_~n |fibonacci_#in~n|))) (and (or (< 4 |fibonacci_#in~n|) (and (<= |fibonacci_#in~n| fibonacci_~n) .cse0)) (or (= fibonacci_~n 8) (not (= |fibonacci_#in~n| 8))) (or (and (<= 5 fibonacci_~n) .cse0) (< 5 |fibonacci_#in~n|) (< |fibonacci_#in~n| 5)) (or (< |fibonacci_#in~n| 9) (< 9 |fibonacci_#in~n|) (and (<= 9 fibonacci_~n) .cse0)) (or (and (<= 6 fibonacci_~n) .cse0) (not (= |fibonacci_#in~n| 6))) (< 1 |fibonacci_#in~n|) (or (not (= |fibonacci_#in~n| 7)) (and (<= 7 fibonacci_~n) .cse0)))) [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L444 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (and (or (< 9 |fibonacci_#in~n|) (and (<= |fibonacci_#t~ret0| 21) (<= |fibonacci_#in~n| fibonacci_~n) (<= 1 |fibonacci_#t~ret0|) (<= fibonacci_~n |fibonacci_#in~n|))) (or (< 3 |fibonacci_#in~n|) (<= |fibonacci_#t~ret0| 1)) (or (<= 2 fibonacci_~n) (< 2 |fibonacci_#in~n|)) (or (<= |fibonacci_#t~ret0| 5) (not (= |fibonacci_#in~n| 6))) (or (not (= |fibonacci_#in~n| 8)) (<= |fibonacci_#t~ret0| 13)) (or (< 5 |fibonacci_#in~n|) (<= |fibonacci_#t~ret0| 3)) (or (not (= |fibonacci_#in~n| 7)) (<= |fibonacci_#t~ret0| 8)) (or (< 4 |fibonacci_#in~n|) (<= |fibonacci_#t~ret0| 2))) [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 15:48:57,251 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 15:48:57,252 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 15:48:57,252 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 15:48:57,252 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 15:48:57,252 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-08 15:48:57,252 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 25 33) the Hoare annotation is: true [2018-12-08 15:48:57,252 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 25 33) no Hoare annotation was computed. [2018-12-08 15:48:57,252 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2018-12-08 15:48:57,252 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (= main_~x~0 9) [2018-12-08 15:48:57,252 INFO L448 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-12-08 15:48:57,252 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 25 33) no Hoare annotation was computed. [2018-12-08 15:48:57,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 03:48:57 BoogieIcfgContainer [2018-12-08 15:48:57,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 15:48:57,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 15:48:57,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 15:48:57,254 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 15:48:57,254 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:47:45" (3/4) ... [2018-12-08 15:48:57,257 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 15:48:57,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2018-12-08 15:48:57,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 15:48:57,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 15:48:57,264 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-08 15:48:57,264 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 15:48:57,264 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 15:48:57,290 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_73cff9cc-2c36-4609-b827-8f401b52cdf4/bin-2019/utaipan/witness.graphml [2018-12-08 15:48:57,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 15:48:57,291 INFO L168 Benchmark]: Toolchain (without parser) took 71967.36 ms. Allocated memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 958.8 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-12-08 15:48:57,292 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:48:57,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 114.28 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 947.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:57,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.44 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:48:57,293 INFO L168 Benchmark]: Boogie Preprocessor took 10.39 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:48:57,293 INFO L168 Benchmark]: RCFGBuilder took 160.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:57,293 INFO L168 Benchmark]: TraceAbstraction took 71631.13 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-12-08 15:48:57,294 INFO L168 Benchmark]: Witness Printer took 36.89 ms. Allocated memory is still 5.9 GB. Free memory is still 2.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:48:57,295 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 114.28 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 947.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.44 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.39 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 160.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 71631.13 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 36.89 ms. Allocated memory is still 5.9 GB. Free memory is still 2.8 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: 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, 71.5s OverallTime, 20 OverallIterations, 109 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 622 SDtfs, 2073 SDslu, 3770 SDs, 0 SdLazy, 3239 SolverSat, 838 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 7608 GetRequests, 6645 SyntacticMatches, 497 SemanticMatches, 466 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13439 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 28.6s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.8188405797101449 AbsIntWeakeningRatio, 0.4057971014492754 AbsIntAvgWeakeningVarsNumRemoved, 0.391304347826087 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 129 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 302 PreInvPairs, 349 NumberOfFragments, 164 HoareAnnotationTreeSize, 302 FomulaSimplifications, 284 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1218 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 37.3s InterpolantComputationTime, 6954 NumberOfCodeBlocks, 6742 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 10312 ConstructedInterpolants, 0 QuantifiedInterpolants, 14207042 SizeOfPredicates, 41 NumberOfNonLiveVariables, 5966 ConjunctsInSsa, 632 ConjunctsInUnsatCore, 50 InterpolantComputations, 7 PerfectInterpolantSequences, 168722/207159 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...