./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3562c726fb0df5872bc6ae08c11ec0d40862c19 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 23:22:14,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:22:14,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:22:14,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:22:14,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:22:14,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:22:14,577 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:22:14,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:22:14,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:22:14,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:22:14,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:22:14,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:22:14,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:22:14,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:22:14,595 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:22:14,595 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:22:14,596 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:22:14,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:22:14,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:22:14,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:22:14,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:22:14,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:22:14,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:22:14,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:22:14,605 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:22:14,606 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:22:14,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:22:14,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:22:14,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:22:14,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:22:14,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:22:14,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:22:14,613 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:22:14,613 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:22:14,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:22:14,614 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:22:14,614 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 23:22:14,630 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:22:14,632 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:22:14,633 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:22:14,633 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:22:14,633 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:22:14,634 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:22:14,634 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 23:22:14,634 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:22:14,634 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 23:22:14,634 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 23:22:14,634 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:22:14,635 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:22:14,635 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:22:14,635 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:22:14,635 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:22:14,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:22:14,635 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:22:14,636 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:22:14,636 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:22:14,636 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:22:14,636 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:22:14,636 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:22:14,640 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:22:14,641 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:22:14,641 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:22:14,641 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:22:14,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:22:14,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:22:14,641 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:22:14,641 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:22:14,642 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 23:22:14,642 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:22:14,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:22:14,642 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 23:22:14,642 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_d1285616-5756-44e0-9eb4-cfa75a9df3a8/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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d3562c726fb0df5872bc6ae08c11ec0d40862c19 [2018-10-26 23:22:14,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:22:14,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:22:14,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:22:14,707 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:22:14,708 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:22:14,708 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-10-26 23:22:14,756 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/data/9bcb43a7c/cb6037b2bd1144ff9050116c98555dbe/FLAGd8201c5b4 [2018-10-26 23:22:15,128 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:22:15,128 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-10-26 23:22:15,134 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/data/9bcb43a7c/cb6037b2bd1144ff9050116c98555dbe/FLAGd8201c5b4 [2018-10-26 23:22:15,146 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/data/9bcb43a7c/cb6037b2bd1144ff9050116c98555dbe [2018-10-26 23:22:15,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:22:15,149 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:22:15,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:22:15,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:22:15,153 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:22:15,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:22:15" (1/1) ... [2018-10-26 23:22:15,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255b6356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15, skipping insertion in model container [2018-10-26 23:22:15,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:22:15" (1/1) ... [2018-10-26 23:22:15,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:22:15,179 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:22:15,303 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:22:15,306 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:22:15,317 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:22:15,327 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:22:15,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15 WrapperNode [2018-10-26 23:22:15,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:22:15,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:22:15,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:22:15,329 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:22:15,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15" (1/1) ... [2018-10-26 23:22:15,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15" (1/1) ... [2018-10-26 23:22:15,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:22:15,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:22:15,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:22:15,347 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:22:15,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15" (1/1) ... [2018-10-26 23:22:15,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15" (1/1) ... [2018-10-26 23:22:15,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15" (1/1) ... [2018-10-26 23:22:15,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15" (1/1) ... [2018-10-26 23:22:15,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15" (1/1) ... [2018-10-26 23:22:15,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15" (1/1) ... [2018-10-26 23:22:15,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15" (1/1) ... [2018-10-26 23:22:15,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:22:15,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:22:15,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:22:15,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:22:15,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/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-10-26 23:22:15,480 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-10-26 23:22:15,481 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-10-26 23:22:15,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:22:15,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:22:15,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:22:15,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:22:15,482 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:22:15,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:22:15,813 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:22:15,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:22:15 BoogieIcfgContainer [2018-10-26 23:22:15,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:22:15,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:22:15,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:22:15,818 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:22:15,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:22:15" (1/3) ... [2018-10-26 23:22:15,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f486fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:22:15, skipping insertion in model container [2018-10-26 23:22:15,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:15" (2/3) ... [2018-10-26 23:22:15,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f486fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:22:15, skipping insertion in model container [2018-10-26 23:22:15,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:22:15" (3/3) ... [2018-10-26 23:22:15,821 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-10-26 23:22:15,829 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:22:15,837 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:22:15,864 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:22:15,915 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:22:15,915 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:22:15,915 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:22:15,915 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:22:15,916 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:22:15,916 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:22:15,916 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:22:15,916 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:22:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-26 23:22:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 23:22:15,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:15,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:22:15,950 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:15,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-10-26 23:22:15,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:16,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:16,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:16,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:16,004 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:22:16,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:22:16,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:22:16,193 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:22:16,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:22:16,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:22:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:22:16,206 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-10-26 23:22:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:22:16,365 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-10-26 23:22:16,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:22:16,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-26 23:22:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:22:16,375 INFO L225 Difference]: With dead ends: 35 [2018-10-26 23:22:16,375 INFO L226 Difference]: Without dead ends: 21 [2018-10-26 23:22:16,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:22:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-26 23:22:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-26 23:22:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-26 23:22:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-10-26 23:22:16,411 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-10-26 23:22:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:22:16,412 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-26 23:22:16,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:22:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-10-26 23:22:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 23:22:16,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:16,414 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:22:16,414 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:16,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:16,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-10-26 23:22:16,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:16,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:16,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:16,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:16,416 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:22:16,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:22:16,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:22:16,469 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:22:16,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:22:16,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:22:16,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:22:16,471 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-10-26 23:22:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:22:16,735 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-10-26 23:22:16,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:22:16,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-26 23:22:16,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:22:16,736 INFO L225 Difference]: With dead ends: 27 [2018-10-26 23:22:16,736 INFO L226 Difference]: Without dead ends: 23 [2018-10-26 23:22:16,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:22:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-26 23:22:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-10-26 23:22:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-26 23:22:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-10-26 23:22:16,744 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-10-26 23:22:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:22:16,744 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-26 23:22:16,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:22:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-10-26 23:22:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 23:22:16,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:16,745 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:22:16,746 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:16,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-10-26 23:22:16,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:16,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:16,747 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:22:16,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:16,858 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:22:16,859 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-26 23:22:16,861 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2018-10-26 23:22:16,906 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:22:16,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:22:17,041 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:22:17,042 INFO L272 AbstractInterpreter]: Visited 16 different actions 31 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-10-26 23:22:17,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:17,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:22:17,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:17,074 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 23:22:17,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:17,097 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:22:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:17,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:22:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:22:17,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:22:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 23:22:17,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:22:17,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2018-10-26 23:22:17,690 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:22:17,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:22:17,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:22:17,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:22:17,691 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-10-26 23:22:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:22:18,024 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-10-26 23:22:18,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:22:18,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-26 23:22:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:22:18,025 INFO L225 Difference]: With dead ends: 38 [2018-10-26 23:22:18,025 INFO L226 Difference]: Without dead ends: 23 [2018-10-26 23:22:18,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-26 23:22:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-26 23:22:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-26 23:22:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-26 23:22:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-26 23:22:18,030 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-10-26 23:22:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:22:18,030 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-26 23:22:18,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:22:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-10-26 23:22:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 23:22:18,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:18,031 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:22:18,031 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:18,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:18,032 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-10-26 23:22:18,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:18,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:18,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:18,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:18,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 23:22:18,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:18,098 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:22:18,098 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-26 23:22:18,099 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2018-10-26 23:22:18,100 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:22:18,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:22:21,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:22:21,145 INFO L272 AbstractInterpreter]: Visited 22 different actions 6845 times. Merged at 10 different actions 1828 times. Never widened. Found 731 fixpoints after 6 different actions. Largest state had 5 variables. [2018-10-26 23:22:21,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:21,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:22:21,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:21,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/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-10-26 23:22:21,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:21,194 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:22:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:21,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:22:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 23:22:21,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:22:21,754 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 23:22:21,921 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 23:22:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 23:22:22,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:22:22,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-10-26 23:22:22,133 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:22:22,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:22:22,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:22:22,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:22:22,134 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-10-26 23:22:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:22:22,240 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-10-26 23:22:22,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:22:22,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-10-26 23:22:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:22:22,242 INFO L225 Difference]: With dead ends: 32 [2018-10-26 23:22:22,242 INFO L226 Difference]: Without dead ends: 28 [2018-10-26 23:22:22,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:22:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-26 23:22:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-26 23:22:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-26 23:22:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-10-26 23:22:22,250 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-10-26 23:22:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:22:22,251 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-10-26 23:22:22,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:22:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-10-26 23:22:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 23:22:22,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:22,254 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:22:22,254 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:22,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:22,254 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-10-26 23:22:22,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:22,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:22,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:22,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:22,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 23:22:22,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:22,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:22:22,480 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 23:22:22,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 23:22:22,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:22,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/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-10-26 23:22:22,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 23:22:22,496 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 23:22:22,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 23:22:22,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:22:22,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:22:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 23:22:22,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:22:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 23:22:22,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:22:22,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-10-26 23:22:22,839 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:22:22,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:22:22,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:22:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:22:22,840 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 6 states. [2018-10-26 23:22:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:22:22,901 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-10-26 23:22:22,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:22:22,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-26 23:22:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:22:22,903 INFO L225 Difference]: With dead ends: 38 [2018-10-26 23:22:22,903 INFO L226 Difference]: Without dead ends: 34 [2018-10-26 23:22:22,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:22:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-26 23:22:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-10-26 23:22:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-26 23:22:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-10-26 23:22:22,911 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 40 [2018-10-26 23:22:22,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:22:22,911 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-10-26 23:22:22,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:22:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-10-26 23:22:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 23:22:22,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:22,918 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:22:22,918 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:22,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2018-10-26 23:22:22,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:22,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:22,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:22:22,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:22,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 23:22:22,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:22,977 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:22:22,977 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 23:22:22,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 23:22:22,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:22,977 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/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-10-26 23:22:22,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 23:22:22,984 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 23:22:23,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 23:22:23,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:22:23,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:22:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 23:22:23,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:22:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:22:23,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:22:23,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 12 [2018-10-26 23:22:23,391 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:22:23,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:22:23,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:22:23,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:22:23,392 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 7 states. [2018-10-26 23:22:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:22:23,490 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2018-10-26 23:22:23,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:22:23,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-26 23:22:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:22:23,492 INFO L225 Difference]: With dead ends: 40 [2018-10-26 23:22:23,492 INFO L226 Difference]: Without dead ends: 36 [2018-10-26 23:22:23,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-10-26 23:22:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-26 23:22:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-10-26 23:22:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-26 23:22:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-10-26 23:22:23,500 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 41 [2018-10-26 23:22:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:22:23,500 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-10-26 23:22:23,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:22:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-10-26 23:22:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 23:22:23,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:23,505 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 7, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:22:23,506 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:23,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:23,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1591893433, now seen corresponding path program 4 times [2018-10-26 23:22:23,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:23,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:23,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:22:23,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:23,508 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 52 proven. 69 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-10-26 23:22:23,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:23,684 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:22:23,685 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 23:22:23,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 23:22:23,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:23,685 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/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-10-26 23:22:23,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:23,692 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:22:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:23,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:22:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 22 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-10-26 23:22:23,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:22:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 22 proven. 134 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-26 23:22:24,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:22:24,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 18 [2018-10-26 23:22:24,381 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:22:24,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:22:24,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:22:24,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-10-26 23:22:24,382 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 14 states. [2018-10-26 23:22:24,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:22:24,923 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2018-10-26 23:22:24,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 23:22:24,923 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-10-26 23:22:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:22:24,926 INFO L225 Difference]: With dead ends: 79 [2018-10-26 23:22:24,926 INFO L226 Difference]: Without dead ends: 50 [2018-10-26 23:22:24,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 143 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=665, Unknown=0, NotChecked=0, Total=930 [2018-10-26 23:22:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-26 23:22:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-10-26 23:22:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 23:22:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2018-10-26 23:22:24,935 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 80 [2018-10-26 23:22:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:22:24,935 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2018-10-26 23:22:24,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:22:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2018-10-26 23:22:24,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 23:22:24,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:24,939 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:22:24,939 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:24,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:24,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2018-10-26 23:22:24,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:24,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:24,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:24,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:24,941 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 319 proven. 55 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2018-10-26 23:22:25,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:25,120 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:22:25,121 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 23:22:25,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 23:22:25,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:25,121 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/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-10-26 23:22:25,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 23:22:25,131 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 23:22:25,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-26 23:22:25,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:22:25,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:22:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 393 proven. 34 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-10-26 23:22:25,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:22:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 393 proven. 41 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-10-26 23:22:25,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:22:25,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 18 [2018-10-26 23:22:25,892 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:22:25,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:22:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:22:25,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-10-26 23:22:25,893 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 14 states. [2018-10-26 23:22:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:22:26,123 INFO L93 Difference]: Finished difference Result 112 states and 167 transitions. [2018-10-26 23:22:26,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 23:22:26,124 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 150 [2018-10-26 23:22:26,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:22:26,125 INFO L225 Difference]: With dead ends: 112 [2018-10-26 23:22:26,125 INFO L226 Difference]: Without dead ends: 65 [2018-10-26 23:22:26,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 285 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2018-10-26 23:22:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-26 23:22:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-10-26 23:22:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-26 23:22:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-10-26 23:22:26,132 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 150 [2018-10-26 23:22:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:22:26,133 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-10-26 23:22:26,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:22:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-10-26 23:22:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 23:22:26,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:26,135 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:22:26,135 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:26,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2018-10-26 23:22:26,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:26,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:22:26,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:26,139 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:22:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:22:26,187 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 23:22:26,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:22:26 BoogieIcfgContainer [2018-10-26 23:22:26,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:22:26,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:22:26,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:22:26,227 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:22:26,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:22:15" (3/4) ... [2018-10-26 23:22:26,230 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 23:22:26,277 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d1285616-5756-44e0-9eb4-cfa75a9df3a8/bin-2019/utaipan/witness.graphml [2018-10-26 23:22:26,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:22:26,278 INFO L168 Benchmark]: Toolchain (without parser) took 11129.79 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 439.4 MB). Free memory was 955.8 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 256.5 MB. Max. memory is 11.5 GB. [2018-10-26 23:22:26,279 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:22:26,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.51 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:22:26,279 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.22 ms. Allocated memory is still 1.0 GB. Free memory is still 945.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:22:26,280 INFO L168 Benchmark]: Boogie Preprocessor took 16.20 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:22:26,280 INFO L168 Benchmark]: RCFGBuilder took 450.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -182.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-10-26 23:22:26,283 INFO L168 Benchmark]: TraceAbstraction took 10412.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.8 MB). Peak memory consumption was 268.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:22:26,283 INFO L168 Benchmark]: Witness Printer took 50.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:22:26,285 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.51 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.22 ms. Allocated memory is still 1.0 GB. Free memory is still 945.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.20 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 450.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -182.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10412.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.8 MB). Peak memory consumption was 268.8 MB. Max. memory is 11.5 GB. * Witness Printer took 50.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L22] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L22] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET return fibonacci(n-1) + fibonacci(n-2); [L22] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L22] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET return fibonacci(n-1) + fibonacci(n-2); [L22] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L22] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L22] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET return fibonacci(n-1) + fibonacci(n-2); [L22] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] RET return fibonacci(n-1) + fibonacci(n-2); [L22] EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L22] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L22] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET return fibonacci(n-1) + fibonacci(n-2); [L22] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L22] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET return fibonacci(n-1) + fibonacci(n-2); [L22] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] RET return fibonacci(n-1) + fibonacci(n-2); [L29] EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L33] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 10.3s OverallTime, 9 OverallIterations, 21 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 175 SDslu, 407 SDs, 0 SdLazy, 538 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 677 SyntacticMatches, 33 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 864 NumberOfCodeBlocks, 783 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1099 ConstructedInterpolants, 0 QuantifiedInterpolants, 163419 SizeOfPredicates, 29 NumberOfNonLiveVariables, 652 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 4101/4677 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...