./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/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_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/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-1dbac8b [2018-11-10 10:28:47,597 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:28:47,598 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:28:47,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:28:47,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:28:47,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:28:47,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:28:47,607 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:28:47,608 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:28:47,609 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:28:47,609 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:28:47,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:28:47,610 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:28:47,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:28:47,611 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:28:47,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:28:47,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:28:47,614 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:28:47,615 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:28:47,616 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:28:47,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:28:47,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:28:47,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:28:47,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:28:47,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:28:47,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:28:47,620 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:28:47,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:28:47,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:28:47,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:28:47,622 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:28:47,622 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:28:47,622 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:28:47,622 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:28:47,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:28:47,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:28:47,623 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-10 10:28:47,630 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:28:47,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:28:47,631 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:28:47,631 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:28:47,631 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:28:47,631 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:28:47,631 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 10:28:47,631 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:28:47,631 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 10:28:47,631 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 10:28:47,631 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:28:47,632 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:28:47,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:28:47,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:28:47,633 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:28:47,633 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:28:47,633 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:28:47,633 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:28:47,633 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:28:47,633 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:28:47,634 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:28:47,634 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 10:28:47,634 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:28:47,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:28:47,634 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 10:28:47,634 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_6cbb09fd-2316-49c8-81b0-56c646cc740e/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-11-10 10:28:47,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:28:47,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:28:47,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:28:47,670 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:28:47,671 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:28:47,671 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 10:28:47,716 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/data/f07054ca2/a4f77a1e19754a1dbc2ae1889b790978/FLAG5b7a7ef5d [2018-11-10 10:28:48,098 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:28:48,098 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 10:28:48,101 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/data/f07054ca2/a4f77a1e19754a1dbc2ae1889b790978/FLAG5b7a7ef5d [2018-11-10 10:28:48,110 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/data/f07054ca2/a4f77a1e19754a1dbc2ae1889b790978 [2018-11-10 10:28:48,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:28:48,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:28:48,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:28:48,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:28:48,115 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:28:48,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:28:48" (1/1) ... [2018-11-10 10:28:48,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48, skipping insertion in model container [2018-11-10 10:28:48,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:28:48" (1/1) ... [2018-11-10 10:28:48,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:28:48,134 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:28:48,225 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:28:48,227 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:28:48,235 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:28:48,243 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:28:48,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48 WrapperNode [2018-11-10 10:28:48,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:28:48,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:28:48,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:28:48,244 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:28:48,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48" (1/1) ... [2018-11-10 10:28:48,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48" (1/1) ... [2018-11-10 10:28:48,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:28:48,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:28:48,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:28:48,256 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:28:48,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48" (1/1) ... [2018-11-10 10:28:48,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48" (1/1) ... [2018-11-10 10:28:48,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48" (1/1) ... [2018-11-10 10:28:48,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48" (1/1) ... [2018-11-10 10:28:48,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48" (1/1) ... [2018-11-10 10:28:48,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48" (1/1) ... [2018-11-10 10:28:48,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48" (1/1) ... [2018-11-10 10:28:48,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:28:48,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:28:48,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:28:48,271 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:28:48,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:28:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-10 10:28:48,352 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-10 10:28:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:28:48,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:28:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:28:48,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:28:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:28:48,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:28:48,459 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:28:48,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:28:48 BoogieIcfgContainer [2018-11-10 10:28:48,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:28:48,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:28:48,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:28:48,463 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:28:48,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:28:48" (1/3) ... [2018-11-10 10:28:48,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42884622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:28:48, skipping insertion in model container [2018-11-10 10:28:48,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:48" (2/3) ... [2018-11-10 10:28:48,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42884622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:28:48, skipping insertion in model container [2018-11-10 10:28:48,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:28:48" (3/3) ... [2018-11-10 10:28:48,466 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 10:28:48,475 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:28:48,481 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-10 10:28:48,494 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-10 10:28:48,521 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:28:48,521 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:28:48,521 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:28:48,521 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:28:48,521 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:28:48,522 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:28:48,522 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:28:48,522 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:28:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-10 10:28:48,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 10:28:48,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:48,542 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:48,544 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:28:48,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:48,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1707029017, now seen corresponding path program 1 times [2018-11-10 10:28:48,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:28:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:48,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:48,589 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:28:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:48,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:28:48,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:28:48,686 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:28:48,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:28:48,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:28:48,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:28:48,698 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2018-11-10 10:28:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:48,781 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-10 10:28:48,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:28:48,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-10 10:28:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:48,787 INFO L225 Difference]: With dead ends: 38 [2018-11-10 10:28:48,787 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 10:28:48,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:28:48,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 10:28:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 10:28:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 10:28:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-10 10:28:48,814 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 10 [2018-11-10 10:28:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:48,814 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 10:28:48,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:28:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-10 10:28:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 10:28:48,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:48,816 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:48,816 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:28:48,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1378291933, now seen corresponding path program 1 times [2018-11-10 10:28:48,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:28:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:48,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:48,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:48,818 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:28:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:48,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:28:48,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:28:48,841 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:28:48,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:28:48,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:28:48,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:28:48,842 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-11-10 10:28:48,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:48,875 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-10 10:28:48,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:28:48,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 10:28:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:48,877 INFO L225 Difference]: With dead ends: 27 [2018-11-10 10:28:48,877 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 10:28:48,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:28:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 10:28:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-10 10:28:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 10:28:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-10 10:28:48,884 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 11 [2018-11-10 10:28:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:48,884 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-10 10:28:48,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:28:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-10 10:28:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 10:28:48,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:48,885 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:48,886 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:28:48,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:48,886 INFO L82 PathProgramCache]: Analyzing trace with hash -995069271, now seen corresponding path program 1 times [2018-11-10 10:28:48,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:28:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:48,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:48,887 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:28:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:28:48,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:48,973 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:28:48,973 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-10 10:28:48,975 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [14], [16], [18], [20], [21], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-11-10 10:28:49,016 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:28:49,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:28:49,118 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 10:28:49,119 INFO L272 AbstractInterpreter]: Visited 13 different actions 55 times. Never merged. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-10 10:28:49,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:49,126 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 10:28:49,177 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 10:28:49,177 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 10:28:49,218 INFO L415 sIntCurrentIteration]: We unified 31 AI predicates to 31 [2018-11-10 10:28:49,218 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 10:28:49,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:28:49,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-10 10:28:49,219 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:28:49,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:28:49,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:28:49,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:28:49,220 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 9 states. [2018-11-10 10:28:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:49,779 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2018-11-10 10:28:49,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:28:49,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-10 10:28:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:49,781 INFO L225 Difference]: With dead ends: 91 [2018-11-10 10:28:49,781 INFO L226 Difference]: Without dead ends: 72 [2018-11-10 10:28:49,781 INFO L605 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-11-10 10:28:49,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-10 10:28:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2018-11-10 10:28:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 10:28:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-11-10 10:28:49,792 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 32 [2018-11-10 10:28:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:49,793 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-11-10 10:28:49,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:28:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-11-10 10:28:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:28:49,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:49,795 INFO L375 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-11-10 10:28:49,795 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:28:49,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:49,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1617198389, now seen corresponding path program 2 times [2018-11-10 10:28:49,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:28:49,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:49,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:49,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:49,797 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:28:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 10:28:49,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:49,859 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:28:49,859 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:28:49,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:28:49,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:49,860 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:28:49,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:28:49,866 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:28:49,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 10:28:49,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:28:49,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 10:28:49,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:28:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 10:28:49,967 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:28:49,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2018-11-10 10:28:49,967 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:28:49,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:28:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:28:49,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:28:49,968 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 5 states. [2018-11-10 10:28:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:49,994 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2018-11-10 10:28:49,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:28:49,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-10 10:28:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:49,997 INFO L225 Difference]: With dead ends: 81 [2018-11-10 10:28:49,997 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 10:28:49,997 INFO L605 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-11-10 10:28:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 10:28:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-11-10 10:28:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 10:28:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2018-11-10 10:28:50,010 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 38 [2018-11-10 10:28:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:50,010 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2018-11-10 10:28:50,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:28:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2018-11-10 10:28:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 10:28:50,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:50,011 INFO L375 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-11-10 10:28:50,012 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:28:50,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1406457547, now seen corresponding path program 1 times [2018-11-10 10:28:50,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:28:50,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:50,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:28:50,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:50,013 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:28:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 10:28:50,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:50,070 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:28:50,070 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-10 10:28:50,070 INFO L202 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-11-10 10:28:50,071 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:28:50,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:28:50,097 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 10:28:50,097 INFO L272 AbstractInterpreter]: Visited 13 different actions 55 times. Never merged. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-10 10:28:50,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:50,099 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 10:28:50,125 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 10:28:50,126 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 10:28:50,184 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-10 10:28:50,184 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 10:28:50,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:28:50,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-10 10:28:50,184 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:28:50,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:28:50,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:28:50,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:28:50,185 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 11 states. [2018-11-10 10:28:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:50,823 INFO L93 Difference]: Finished difference Result 153 states and 187 transitions. [2018-11-10 10:28:50,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:28:50,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-11-10 10:28:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:50,824 INFO L225 Difference]: With dead ends: 153 [2018-11-10 10:28:50,824 INFO L226 Difference]: Without dead ends: 97 [2018-11-10 10:28:50,824 INFO L605 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-11-10 10:28:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-10 10:28:50,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-11-10 10:28:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 10:28:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2018-11-10 10:28:50,834 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 39 [2018-11-10 10:28:50,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:50,834 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2018-11-10 10:28:50,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:28:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2018-11-10 10:28:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:28:50,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:50,835 INFO L375 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-11-10 10:28:50,836 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:28:50,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1228913769, now seen corresponding path program 2 times [2018-11-10 10:28:50,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:28:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:50,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:50,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:50,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:28:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 10:28:50,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:50,878 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:28:50,878 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:28:50,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:28:50,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:50,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:28:50,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:28:50,887 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:28:50,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 10:28:50,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:28:50,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-10 10:28:50,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:28:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-10 10:28:50,982 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:28:50,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2018-11-10 10:28:50,982 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:28:50,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:28:50,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:28:50,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:28:50,983 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 5 states. [2018-11-10 10:28:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:50,997 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2018-11-10 10:28:50,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:28:50,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-10 10:28:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:50,999 INFO L225 Difference]: With dead ends: 104 [2018-11-10 10:28:50,999 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 10:28:50,999 INFO L605 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-11-10 10:28:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 10:28:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-11-10 10:28:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 10:28:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2018-11-10 10:28:51,008 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 45 [2018-11-10 10:28:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:51,008 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2018-11-10 10:28:51,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:28:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2018-11-10 10:28:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:28:51,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:51,009 INFO L375 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-11-10 10:28:51,009 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:28:51,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:51,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1240405343, now seen corresponding path program 1 times [2018-11-10 10:28:51,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:28:51,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:51,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:28:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:51,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:28:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 10:28:51,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:51,039 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:28:51,039 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-10 10:28:51,039 INFO L202 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-11-10 10:28:51,040 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:28:51,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:28:51,076 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 10:28:51,076 INFO L272 AbstractInterpreter]: Visited 23 different actions 141 times. Merged at 4 different actions 12 times. Widened at 1 different actions 5 times. Found 3 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-10 10:28:51,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:51,077 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 10:28:51,101 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 10:28:51,101 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 10:28:51,162 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-11-10 10:28:51,162 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 10:28:51,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:28:51,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-10 10:28:51,162 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:28:51,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:28:51,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:28:51,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:28:51,163 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand 13 states. [2018-11-10 10:28:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:51,840 INFO L93 Difference]: Finished difference Result 207 states and 261 transitions. [2018-11-10 10:28:51,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:28:51,840 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-11-10 10:28:51,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:51,842 INFO L225 Difference]: With dead ends: 207 [2018-11-10 10:28:51,844 INFO L226 Difference]: Without dead ends: 125 [2018-11-10 10:28:51,846 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:28:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-10 10:28:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2018-11-10 10:28:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 10:28:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 144 transitions. [2018-11-10 10:28:51,855 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 144 transitions. Word has length 45 [2018-11-10 10:28:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:51,855 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 144 transitions. [2018-11-10 10:28:51,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:28:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 144 transitions. [2018-11-10 10:28:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 10:28:51,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:51,856 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:51,857 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:28:51,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1594700675, now seen corresponding path program 2 times [2018-11-10 10:28:51,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:28:51,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:51,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:51,858 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:28:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 10:28:51,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:51,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:28:51,907 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:28:51,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:28:51,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:51,908 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:28:51,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:28:51,915 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:28:51,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 10:28:51,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:28:51,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-10 10:28:51,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:28:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-10 10:28:52,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:28:52,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 13 [2018-11-10 10:28:52,028 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:28:52,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:28:52,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:28:52,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:28:52,029 INFO L87 Difference]: Start difference. First operand 115 states and 144 transitions. Second operand 6 states. [2018-11-10 10:28:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:52,062 INFO L93 Difference]: Finished difference Result 142 states and 180 transitions. [2018-11-10 10:28:52,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:28:52,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-10 10:28:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:52,064 INFO L225 Difference]: With dead ends: 142 [2018-11-10 10:28:52,064 INFO L226 Difference]: Without dead ends: 141 [2018-11-10 10:28:52,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:28:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-10 10:28:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2018-11-10 10:28:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 10:28:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 158 transitions. [2018-11-10 10:28:52,075 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 158 transitions. Word has length 51 [2018-11-10 10:28:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:52,075 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 158 transitions. [2018-11-10 10:28:52,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:28:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 158 transitions. [2018-11-10 10:28:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 10:28:52,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:52,077 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:52,077 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:28:52,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash -936495508, now seen corresponding path program 1 times [2018-11-10 10:28:52,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:28:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:52,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:28:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:52,078 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:28:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-10 10:28:52,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:52,121 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:28:52,121 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-11-10 10:28:52,121 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [14], [16], [18], [20], [21], [22], [24], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-11-10 10:28:52,122 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:28:52,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:28:52,132 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 10:28:52,132 INFO L272 AbstractInterpreter]: Visited 13 different actions 55 times. Never merged. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-10 10:28:52,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:52,136 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 10:28:52,159 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 10:28:52,159 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 10:28:52,263 INFO L415 sIntCurrentIteration]: We unified 68 AI predicates to 68 [2018-11-10 10:28:52,263 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 10:28:52,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:28:52,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-11-10 10:28:52,263 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:28:52,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 10:28:52,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 10:28:52,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:28:52,264 INFO L87 Difference]: Start difference. First operand 123 states and 158 transitions. Second operand 15 states. [2018-11-10 10:28:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:53,216 INFO L93 Difference]: Finished difference Result 250 states and 321 transitions. [2018-11-10 10:28:53,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 10:28:53,216 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2018-11-10 10:28:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:53,217 INFO L225 Difference]: With dead ends: 250 [2018-11-10 10:28:53,217 INFO L226 Difference]: Without dead ends: 145 [2018-11-10 10:28:53,218 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-11-10 10:28:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-10 10:28:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133. [2018-11-10 10:28:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 10:28:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 168 transitions. [2018-11-10 10:28:53,229 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 168 transitions. Word has length 69 [2018-11-10 10:28:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:53,230 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 168 transitions. [2018-11-10 10:28:53,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 10:28:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 168 transitions. [2018-11-10 10:28:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 10:28:53,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:53,231 INFO L375 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 7, 7, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:53,231 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:28:53,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:53,232 INFO L82 PathProgramCache]: Analyzing trace with hash 182842250, now seen corresponding path program 2 times [2018-11-10 10:28:53,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:28:53,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:53,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:53,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:28:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-10 10:28:53,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:53,272 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:28:53,272 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:28:53,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:28:53,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:53,272 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:28:53,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:28:53,279 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:28:53,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 10:28:53,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:28:53,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-10 10:28:53,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:28:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-10 10:28:53,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:28:53,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 7 [2018-11-10 10:28:53,448 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:28:53,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:28:53,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:28:53,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:28:53,449 INFO L87 Difference]: Start difference. First operand 133 states and 168 transitions. Second operand 6 states. [2018-11-10 10:28:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:53,498 INFO L93 Difference]: Finished difference Result 248 states and 332 transitions. [2018-11-10 10:28:53,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:28:53,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-10 10:28:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:53,500 INFO L225 Difference]: With dead ends: 248 [2018-11-10 10:28:53,500 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 10:28:53,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 147 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:28:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 10:28:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-11-10 10:28:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 10:28:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 166 transitions. [2018-11-10 10:28:53,518 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 166 transitions. Word has length 75 [2018-11-10 10:28:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:53,519 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 166 transitions. [2018-11-10 10:28:53,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:28:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 166 transitions. [2018-11-10 10:28:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 10:28:53,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:53,520 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:53,520 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:28:53,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:53,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1560689608, now seen corresponding path program 1 times [2018-11-10 10:28:53,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:28:53,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:53,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:28:53,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:53,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:28:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-10 10:28:53,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:53,572 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:28:53,572 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 78 with the following transitions: [2018-11-10 10:28:53,572 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [21], [22], [24], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-11-10 10:28:53,573 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:28:53,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:32:43,186 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 10:32:43,187 INFO L272 AbstractInterpreter]: Visited 25 different actions 1978821 times. Merged at 10 different actions 613035 times. Widened at 2 different actions 74955 times. Found 83033 fixpoints after 5 different actions. Largest state had 5 variables. [2018-11-10 10:32:43,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:43,191 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 10:32:43,230 INFO L227 lantSequenceWeakener]: Weakened 61 states. On average, predicates are now at 49.45% of their original sizes. [2018-11-10 10:32:43,230 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 10:32:43,674 INFO L415 sIntCurrentIteration]: We unified 76 AI predicates to 76 [2018-11-10 10:32:43,674 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 10:32:43,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:32:43,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [7] total 36 [2018-11-10 10:32:43,674 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:32:43,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 10:32:43,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 10:32:43,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-11-10 10:32:43,675 INFO L87 Difference]: Start difference. First operand 133 states and 166 transitions. Second operand 31 states. [2018-11-10 10:32:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:48,489 INFO L93 Difference]: Finished difference Result 338 states and 443 transitions. [2018-11-10 10:32:48,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-10 10:32:48,489 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 77 [2018-11-10 10:32:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:48,491 INFO L225 Difference]: With dead ends: 338 [2018-11-10 10:32:48,491 INFO L226 Difference]: Without dead ends: 223 [2018-11-10 10:32:48,493 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 128 GetRequests, 38 SyntacticMatches, 15 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1460 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=701, Invalid=5151, Unknown=0, NotChecked=0, Total=5852 [2018-11-10 10:32:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-10 10:32:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 161. [2018-11-10 10:32:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-10 10:32:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2018-11-10 10:32:48,503 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 77 [2018-11-10 10:32:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:48,503 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2018-11-10 10:32:48,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 10:32:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2018-11-10 10:32:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 10:32:48,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:48,505 INFO L375 BasicCegarLoop]: trace histogram [14, 11, 10, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:32:48,505 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:32:48,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2081460971, now seen corresponding path program 2 times [2018-11-10 10:32:48,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:32:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:48,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:48,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:32:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 105 proven. 119 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-10 10:32:48,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:48,596 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:32:48,596 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:32:48,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:32:48,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:48,596 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:32:48,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:32:48,602 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:32:48,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 10:32:48,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:32:48,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 275 proven. 51 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-10 10:32:48,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 118 proven. 135 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-10 10:32:48,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:32:48,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 16 [2018-11-10 10:32:48,892 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:32:48,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:32:48,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:32:48,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-11-10 10:32:48,893 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 12 states. [2018-11-10 10:32:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:49,021 INFO L93 Difference]: Finished difference Result 410 states and 507 transitions. [2018-11-10 10:32:49,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:32:49,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 123 [2018-11-10 10:32:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:49,027 INFO L225 Difference]: With dead ends: 410 [2018-11-10 10:32:49,027 INFO L226 Difference]: Without dead ends: 260 [2018-11-10 10:32:49,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 234 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-11-10 10:32:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-10 10:32:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 212. [2018-11-10 10:32:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-10 10:32:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2018-11-10 10:32:49,046 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 123 [2018-11-10 10:32:49,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:49,046 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2018-11-10 10:32:49,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:32:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2018-11-10 10:32:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 10:32:49,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:49,048 INFO L375 BasicCegarLoop]: trace histogram [20, 16, 14, 11, 11, 11, 11, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:32:49,048 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:32:49,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:49,049 INFO L82 PathProgramCache]: Analyzing trace with hash -493643000, now seen corresponding path program 3 times [2018-11-10 10:32:49,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:32:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:49,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:32:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:49,049 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:32:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 107 proven. 215 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-11-10 10:32:49,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:49,155 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:32:49,155 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:32:49,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:32:49,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:49,156 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/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-11-10 10:32:49,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:32:49,161 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 10:32:49,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:32:49,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:32:49,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 547 proven. 292 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-10 10:32:49,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 49 proven. 623 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-11-10 10:32:49,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:32:49,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 19] total 26 [2018-11-10 10:32:49,622 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:32:49,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 10:32:49,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 10:32:49,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2018-11-10 10:32:49,623 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand 22 states. [2018-11-10 10:32:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:50,001 INFO L93 Difference]: Finished difference Result 507 states and 624 transitions. [2018-11-10 10:32:50,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 10:32:50,001 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 180 [2018-11-10 10:32:50,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:50,003 INFO L225 Difference]: With dead ends: 507 [2018-11-10 10:32:50,003 INFO L226 Difference]: Without dead ends: 265 [2018-11-10 10:32:50,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 331 SyntacticMatches, 17 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1399, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 10:32:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-10 10:32:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 226. [2018-11-10 10:32:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-10 10:32:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 258 transitions. [2018-11-10 10:32:50,015 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 258 transitions. Word has length 180 [2018-11-10 10:32:50,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:50,015 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 258 transitions. [2018-11-10 10:32:50,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 10:32:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 258 transitions. [2018-11-10 10:32:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-10 10:32:50,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:50,018 INFO L375 BasicCegarLoop]: trace histogram [32, 28, 26, 17, 17, 17, 17, 14, 14, 14, 14, 14, 14, 14, 13, 13, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:32:50,018 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:32:50,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:50,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1398859736, now seen corresponding path program 4 times [2018-11-10 10:32:50,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:32:50,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:50,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:32:50,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:50,020 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:32:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 947 proven. 168 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2018-11-10 10:32:50,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:50,161 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:32:50,161 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:32:50,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:32:50,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:50,162 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/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-11-10 10:32:50,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:50,169 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:32:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:50,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 708 proven. 660 refuted. 0 times theorem prover too weak. 1737 trivial. 0 not checked. [2018-11-10 10:32:50,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 705 proven. 681 refuted. 0 times theorem prover too weak. 1719 trivial. 0 not checked. [2018-11-10 10:32:50,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:32:50,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 20] total 29 [2018-11-10 10:32:50,879 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:32:50,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 10:32:50,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 10:32:50,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2018-11-10 10:32:50,880 INFO L87 Difference]: Start difference. First operand 226 states and 258 transitions. Second operand 24 states. [2018-11-10 10:32:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:51,359 INFO L93 Difference]: Finished difference Result 509 states and 606 transitions. [2018-11-10 10:32:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 10:32:51,361 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 300 [2018-11-10 10:32:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:51,362 INFO L225 Difference]: With dead ends: 509 [2018-11-10 10:32:51,362 INFO L226 Difference]: Without dead ends: 277 [2018-11-10 10:32:51,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 573 SyntacticMatches, 18 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=748, Invalid=2114, Unknown=0, NotChecked=0, Total=2862 [2018-11-10 10:32:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-10 10:32:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 239. [2018-11-10 10:32:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-10 10:32:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 261 transitions. [2018-11-10 10:32:51,377 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 261 transitions. Word has length 300 [2018-11-10 10:32:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:51,378 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 261 transitions. [2018-11-10 10:32:51,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 10:32:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 261 transitions. [2018-11-10 10:32:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 10:32:51,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:51,381 INFO L375 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-11-10 10:32:51,381 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:32:51,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:51,382 INFO L82 PathProgramCache]: Analyzing trace with hash -333231388, now seen corresponding path program 5 times [2018-11-10 10:32:51,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:32:51,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:51,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:51,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:51,383 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:32:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2018-11-10 10:32:51,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:51,563 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:32:51,564 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:32:51,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:32:51,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:51,564 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/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-11-10 10:32:51,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:32:51,571 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:32:51,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-10 10:32:51,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:32:51,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2018-11-10 10:32:51,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 429 proven. 355 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2018-11-10 10:32:53,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:32:53,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 23] total 33 [2018-11-10 10:32:53,449 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:32:53,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 10:32:53,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 10:32:53,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 10:32:53,450 INFO L87 Difference]: Start difference. First operand 239 states and 261 transitions. Second operand 21 states. [2018-11-10 10:32:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:53,514 INFO L93 Difference]: Finished difference Result 301 states and 333 transitions. [2018-11-10 10:32:53,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 10:32:53,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 261 [2018-11-10 10:32:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:53,516 INFO L225 Difference]: With dead ends: 301 [2018-11-10 10:32:53,516 INFO L226 Difference]: Without dead ends: 300 [2018-11-10 10:32:53,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 505 SyntacticMatches, 33 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=913, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 10:32:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-10 10:32:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 254. [2018-11-10 10:32:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-10 10:32:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2018-11-10 10:32:53,532 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 261 [2018-11-10 10:32:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:53,533 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2018-11-10 10:32:53,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 10:32:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2018-11-10 10:32:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-10 10:32:53,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:53,535 INFO L375 BasicCegarLoop]: trace histogram [28, 24, 23, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 12, 11, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:32:53,535 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:32:53,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:53,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1740238382, now seen corresponding path program 1 times [2018-11-10 10:32:53,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:32:53,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:53,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:32:53,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:53,536 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:32:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 304 proven. 417 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2018-11-10 10:32:53,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:53,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:32:53,727 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-11-10 10:32:53,727 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [22], [23], [24], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-11-10 10:32:53,729 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:32:53,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:36:41,364 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 10:36:41,364 INFO L272 AbstractInterpreter]: Visited 25 different actions 1978821 times. Merged at 10 different actions 613035 times. Widened at 2 different actions 74955 times. Found 83033 fixpoints after 5 different actions. Largest state had 5 variables. [2018-11-10 10:36:41,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:41,371 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 10:36:41,478 INFO L227 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 43.74% of their original sizes. [2018-11-10 10:36:41,478 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 10:36:43,827 INFO L415 sIntCurrentIteration]: We unified 261 AI predicates to 261 [2018-11-10 10:36:43,827 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 10:36:43,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:36:43,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [81] imperfect sequences [19] total 99 [2018-11-10 10:36:43,827 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:36:43,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-11-10 10:36:43,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-11-10 10:36:43,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=5906, Unknown=0, NotChecked=0, Total=6480 [2018-11-10 10:36:43,829 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand 81 states. [2018-11-10 10:36:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:45,530 INFO L93 Difference]: Finished difference Result 295 states and 337 transitions. [2018-11-10 10:36:45,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 10:36:45,531 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 262 [2018-11-10 10:36:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:45,531 INFO L225 Difference]: With dead ends: 295 [2018-11-10 10:36:45,531 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 10:36:45,533 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 273 GetRequests, 150 SyntacticMatches, 32 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3877 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=752, Invalid=7804, Unknown=0, NotChecked=0, Total=8556 [2018-11-10 10:36:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 10:36:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 10:36:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 10:36:45,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:36:45,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 262 [2018-11-10 10:36:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:45,534 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:36:45,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-11-10 10:36:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:36:45,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 10:36:45,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 10:36:45,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:36:45,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:36:46,118 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 26 [2018-11-10 10:36:46,596 WARN L179 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 40 [2018-11-10 10:36:46,598 INFO L425 ceAbstractionStarter]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,598 INFO L425 ceAbstractionStarter]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,598 INFO L425 ceAbstractionStarter]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,598 INFO L425 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2018-11-10 10:36:46,599 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2018-11-10 10:36:46,599 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-11-10 10:36:46,599 INFO L425 ceAbstractionStarter]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,599 INFO L425 ceAbstractionStarter]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,599 INFO L425 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2018-11-10 10:36:46,599 INFO L428 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2018-11-10 10:36:46,599 INFO L425 ceAbstractionStarter]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,599 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,599 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,599 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse1 (<= fibonacci_~n |fibonacci_#in~n|))) (let ((.cse2 (and (<= |fibonacci_#in~n| fibonacci_~n) .cse1)) (.cse0 (< (* 2 |fibonacci_#in~n|) 0))) (and (or (< 1 |fibonacci_#in~n|) .cse0) (or (or (< 7 |fibonacci_#in~n|) (< |fibonacci_#in~n| 7)) (and (<= 14 (* 2 fibonacci_~n)) .cse1)) (or (not (= |fibonacci_#in~n| 8)) .cse2) (or .cse2 (< |fibonacci_#in~n| 9) (< 9 |fibonacci_#in~n|)) (or .cse2 .cse0 (< 6 |fibonacci_#in~n|))))) [2018-11-10 10:36:46,600 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,600 INFO L425 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,600 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,600 INFO L421 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (and (or (< 7 |fibonacci_#in~n|) (< |fibonacci_#in~n| 7)) (or (< |fibonacci_#in~n| 9) (< 9 |fibonacci_#in~n|)) (not (= |fibonacci_#in~n| 8)) (or (< (* 2 |fibonacci_#in~n|) 0) (< 6 |fibonacci_#in~n|))) [2018-11-10 10:36:46,600 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,600 INFO L425 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,600 INFO L425 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2018-11-10 10:36:46,600 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 10:36:46,600 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:36:46,600 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:36:46,600 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 10:36:46,600 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:36:46,600 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:36:46,600 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-10 10:36:46,601 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 25 33) the Hoare annotation is: true [2018-11-10 10:36:46,601 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 25 33) no Hoare annotation was computed. [2018-11-10 10:36:46,601 INFO L425 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2018-11-10 10:36:46,601 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (= main_~x~0 9) [2018-11-10 10:36:46,601 INFO L425 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-11-10 10:36:46,601 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 25 33) no Hoare annotation was computed. [2018-11-10 10:36:46,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:36:46 BoogieIcfgContainer [2018-11-10 10:36:46,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:36:46,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:36:46,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:36:46,604 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:36:46,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:28:48" (3/4) ... [2018-11-10 10:36:46,607 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 10:36:46,612 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2018-11-10 10:36:46,612 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 10:36:46,612 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 10:36:46,616 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 10:36:46,616 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 10:36:46,616 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 10:36:46,650 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6cbb09fd-2316-49c8-81b0-56c646cc740e/bin-2019/utaipan/witness.graphml [2018-11-10 10:36:46,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:36:46,651 INFO L168 Benchmark]: Toolchain (without parser) took 478538.72 ms. Allocated memory was 1.0 GB in the beginning and 12.0 GB in the end (delta: 11.0 GB). Free memory was 960.3 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 8.3 GB. Max. memory is 11.5 GB. [2018-11-10 10:36:46,653 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:36:46,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 130.03 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:36:46,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.58 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:36:46,653 INFO L168 Benchmark]: Boogie Preprocessor took 13.93 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:36:46,654 INFO L168 Benchmark]: RCFGBuilder took 189.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:36:46,654 INFO L168 Benchmark]: TraceAbstraction took 478142.93 ms. Allocated memory was 1.2 GB in the beginning and 12.0 GB in the end (delta: 10.9 GB). Free memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 8.3 GB. Max. memory is 11.5 GB. [2018-11-10 10:36:46,654 INFO L168 Benchmark]: Witness Printer took 46.84 ms. Allocated memory is still 12.0 GB. Free memory is still 3.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:36:46,659 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 130.03 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.58 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.93 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 189.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 478142.93 ms. Allocated memory was 1.2 GB in the beginning and 12.0 GB in the end (delta: 10.9 GB). Free memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 8.3 GB. Max. memory is 11.5 GB. * Witness Printer took 46.84 ms. Allocated memory is still 12.0 GB. Free memory is still 3.7 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, 478.0s OverallTime, 16 OverallIterations, 32 TraceHistogramMax, 10.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 541 SDtfs, 1921 SDslu, 3485 SDs, 0 SdLazy, 5927 SolverSat, 687 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 2923 GetRequests, 2372 SyntacticMatches, 138 SemanticMatches, 413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7775 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 457.4s AbstIntTime, 6 AbstIntIterations, 6 AbstIntStrong, 0.9281853281853311 AbsIntWeakeningRatio, 0.39768339768339767 AbsIntAvgWeakeningVarsNumRemoved, 4.117760617760617 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 298 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 515 PreInvPairs, 571 NumberOfFragments, 119 HoareAnnotationTreeSize, 515 FomulaSimplifications, 5834 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 8 FomulaSimplificationsInter, 5001 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2691 NumberOfCodeBlocks, 2470 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 3732 ConstructedInterpolants, 0 QuantifiedInterpolants, 1406131 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1638 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 20271/24842 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...