./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/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 d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-02 18:50:55,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 18:50:55,701 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 18:50:55,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 18:50:55,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 18:50:55,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 18:50:55,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 18:50:55,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 18:50:55,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 18:50:55,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 18:50:55,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 18:50:55,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 18:50:55,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 18:50:55,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 18:50:55,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 18:50:55,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 18:50:55,714 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 18:50:55,715 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 18:50:55,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 18:50:55,717 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 18:50:55,717 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 18:50:55,718 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 18:50:55,719 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 18:50:55,719 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 18:50:55,719 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 18:50:55,720 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 18:50:55,720 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 18:50:55,721 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 18:50:55,721 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 18:50:55,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 18:50:55,722 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 18:50:55,722 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 18:50:55,722 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 18:50:55,723 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 18:50:55,723 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 18:50:55,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 18:50:55,724 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 18:50:55,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 18:50:55,731 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 18:50:55,731 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 18:50:55,731 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 18:50:55,732 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 18:50:55,732 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 18:50:55,732 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 18:50:55,732 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 18:50:55,732 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 18:50:55,732 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 18:50:55,732 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 18:50:55,732 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 18:50:55,733 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 18:50:55,733 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 18:50:55,733 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 18:50:55,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 18:50:55,733 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 18:50:55,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 18:50:55,734 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 18:50:55,734 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 18:50:55,734 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 18:50:55,734 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 18:50:55,734 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 18:50:55,734 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 18:50:55,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 18:50:55,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 18:50:55,734 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 18:50:55,735 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 18:50:55,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 18:50:55,735 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 18:50:55,735 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 18:50:55,735 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 18:50:55,735 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 18:50:55,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 18:50:55,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 18:50:55,735 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 18:50:55,736 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_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/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 -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2018-12-02 18:50:55,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 18:50:55,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 18:50:55,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 18:50:55,767 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 18:50:55,767 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 18:50:55,768 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-12-02 18:50:55,810 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/data/aa9a1915a/c0d7ad55fe6445c5ae1612f9bbecf633/FLAG1a92a4fa3 [2018-12-02 18:50:56,248 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 18:50:56,248 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-12-02 18:50:56,252 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/data/aa9a1915a/c0d7ad55fe6445c5ae1612f9bbecf633/FLAG1a92a4fa3 [2018-12-02 18:50:56,260 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/data/aa9a1915a/c0d7ad55fe6445c5ae1612f9bbecf633 [2018-12-02 18:50:56,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 18:50:56,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 18:50:56,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 18:50:56,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 18:50:56,265 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 18:50:56,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:50:56" (1/1) ... [2018-12-02 18:50:56,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489644d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56, skipping insertion in model container [2018-12-02 18:50:56,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:50:56" (1/1) ... [2018-12-02 18:50:56,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 18:50:56,280 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 18:50:56,364 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 18:50:56,366 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 18:50:56,375 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 18:50:56,382 INFO L195 MainTranslator]: Completed translation [2018-12-02 18:50:56,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56 WrapperNode [2018-12-02 18:50:56,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 18:50:56,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 18:50:56,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 18:50:56,383 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 18:50:56,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56" (1/1) ... [2018-12-02 18:50:56,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56" (1/1) ... [2018-12-02 18:50:56,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 18:50:56,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 18:50:56,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 18:50:56,395 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 18:50:56,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56" (1/1) ... [2018-12-02 18:50:56,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56" (1/1) ... [2018-12-02 18:50:56,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56" (1/1) ... [2018-12-02 18:50:56,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56" (1/1) ... [2018-12-02 18:50:56,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56" (1/1) ... [2018-12-02 18:50:56,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56" (1/1) ... [2018-12-02 18:50:56,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56" (1/1) ... [2018-12-02 18:50:56,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 18:50:56,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 18:50:56,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 18:50:56,406 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 18:50:56,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 18:50:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 18:50:56,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 18:50:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 18:50:56,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 18:50:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 18:50:56,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 18:50:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-02 18:50:56,469 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-02 18:50:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-02 18:50:56,469 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-02 18:50:56,559 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 18:50:56,559 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 18:50:56,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:50:56 BoogieIcfgContainer [2018-12-02 18:50:56,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 18:50:56,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 18:50:56,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 18:50:56,562 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 18:50:56,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:50:56" (1/3) ... [2018-12-02 18:50:56,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9f4617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:50:56, skipping insertion in model container [2018-12-02 18:50:56,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:56" (2/3) ... [2018-12-02 18:50:56,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9f4617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:50:56, skipping insertion in model container [2018-12-02 18:50:56,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:50:56" (3/3) ... [2018-12-02 18:50:56,564 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6_false-unreach-call_true-termination.c [2018-12-02 18:50:56,569 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 18:50:56,574 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 18:50:56,583 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 18:50:56,602 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 18:50:56,602 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 18:50:56,602 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 18:50:56,602 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 18:50:56,602 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 18:50:56,602 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 18:50:56,602 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 18:50:56,602 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 18:50:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-02 18:50:56,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 18:50:56,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:50:56,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:50:56,618 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:50:56,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-02 18:50:56,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:50:56,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:56,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:50:56,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:56,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:50:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:50:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:50:56,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:50:56,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 18:50:56,728 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:50:56,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 18:50:56,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 18:50:56,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 18:50:56,740 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-02 18:50:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:50:56,792 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-02 18:50:56,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 18:50:56,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 18:50:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:50:56,799 INFO L225 Difference]: With dead ends: 44 [2018-12-02 18:50:56,799 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 18:50:56,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 18:50:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 18:50:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-02 18:50:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 18:50:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-02 18:50:56,828 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-02 18:50:56,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:50:56,828 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-02 18:50:56,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 18:50:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-02 18:50:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 18:50:56,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:50:56,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:50:56,830 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:50:56,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-02 18:50:56,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:50:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:56,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:50:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:56,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:50:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:50:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:50:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:50:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 18:50:56,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:50:56,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 18:50:56,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 18:50:56,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 18:50:56,862 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-02 18:50:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:50:56,909 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-02 18:50:56,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 18:50:56,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 18:50:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:50:56,910 INFO L225 Difference]: With dead ends: 36 [2018-12-02 18:50:56,910 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 18:50:56,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 18:50:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 18:50:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-02 18:50:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 18:50:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-02 18:50:56,917 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-02 18:50:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:50:56,917 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-02 18:50:56,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 18:50:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-02 18:50:56,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 18:50:56,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:50:56,918 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:50:56,919 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:50:56,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:56,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-02 18:50:56,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:50:56,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:56,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:50:56,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:56,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:50:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:50:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 18:50:56,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:50:56,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 18:50:56,970 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-02 18:50:56,971 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-12-02 18:50:56,990 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 18:50:56,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 18:50:57,051 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 18:50:57,051 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-02 18:50:57,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:57,058 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 18:50:57,085 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-12-02 18:50:57,085 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 18:50:57,100 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-02 18:50:57,101 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 18:50:57,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 18:50:57,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-12-02 18:50:57,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:50:57,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 18:50:57,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 18:50:57,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 18:50:57,102 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-12-02 18:50:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:50:57,215 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-12-02 18:50:57,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 18:50:57,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-02 18:50:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:50:57,217 INFO L225 Difference]: With dead ends: 72 [2018-12-02 18:50:57,217 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 18:50:57,218 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 18:50:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 18:50:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-02 18:50:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 18:50:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-02 18:50:57,225 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-12-02 18:50:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:50:57,225 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-02 18:50:57,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 18:50:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-02 18:50:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 18:50:57,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:50:57,227 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:50:57,227 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:50:57,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-02 18:50:57,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:50:57,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:57,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:50:57,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:57,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:50:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:50:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 18:50:57,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:50:57,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 18:50:57,273 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-02 18:50:57,273 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-02 18:50:57,275 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 18:50:57,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 18:50:57,344 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 18:50:57,344 INFO L272 AbstractInterpreter]: Visited 28 different actions 200 times. Never merged. Widened at 2 different actions 11 times. Performed 411 root evaluator evaluations with a maximum evaluation depth of 4. Performed 411 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 18 fixpoints after 6 different actions. Largest state had 5 variables. [2018-12-02 18:50:57,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:57,346 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 18:50:57,356 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-12-02 18:50:57,356 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 18:50:57,377 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-02 18:50:57,377 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 18:50:57,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 18:50:57,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-02 18:50:57,377 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:50:57,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 18:50:57,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 18:50:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 18:50:57,378 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-12-02 18:50:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:50:57,541 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-02 18:50:57,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 18:50:57,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-12-02 18:50:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:50:57,542 INFO L225 Difference]: With dead ends: 87 [2018-12-02 18:50:57,542 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 18:50:57,542 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-02 18:50:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 18:50:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-02 18:50:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 18:50:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-12-02 18:50:57,547 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-12-02 18:50:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:50:57,548 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-12-02 18:50:57,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 18:50:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-12-02 18:50:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 18:50:57,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:50:57,549 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:50:57,549 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:50:57,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:57,549 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-12-02 18:50:57,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:50:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:57,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:50:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:57,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:50:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:50:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 18:50:57,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:50:57,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 18:50:57,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 18:50:57,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 18:50:57,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:50:57,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 18:50:57,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 18:50:57,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 18:50:57,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 18:50:57,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 18:50:57,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 18:50:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 18:50:57,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 18:50:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 18:50:57,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 18:50:57,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-12-02 18:50:57,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 18:50:57,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 18:50:57,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 18:50:57,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-02 18:50:57,905 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-12-02 18:50:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:50:58,056 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-12-02 18:50:58,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 18:50:58,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-12-02 18:50:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:50:58,058 INFO L225 Difference]: With dead ends: 121 [2018-12-02 18:50:58,058 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 18:50:58,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-12-02 18:50:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 18:50:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-12-02 18:50:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 18:50:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-12-02 18:50:58,066 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-12-02 18:50:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:50:58,066 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-12-02 18:50:58,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 18:50:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-12-02 18:50:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 18:50:58,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:50:58,068 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:50:58,068 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:50:58,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-12-02 18:50:58,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:50:58,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:58,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 18:50:58,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:58,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:50:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:50:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 18:50:58,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:50:58,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 18:50:58,113 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-02 18:50:58,113 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-02 18:50:58,115 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 18:50:58,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 18:50:58,746 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 18:50:58,746 INFO L272 AbstractInterpreter]: Visited 29 different actions 3929 times. Merged at 11 different actions 1050 times. Widened at 2 different actions 189 times. Performed 9241 root evaluator evaluations with a maximum evaluation depth of 4. Performed 9241 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 481 fixpoints after 9 different actions. Largest state had 5 variables. [2018-12-02 18:50:58,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:58,751 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 18:50:58,761 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 56.25% of their original sizes. [2018-12-02 18:50:58,761 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 18:50:58,809 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-02 18:50:58,809 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 18:50:58,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 18:50:58,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-12-02 18:50:58,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:50:58,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 18:50:58,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 18:50:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 18:50:58,811 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 13 states. [2018-12-02 18:50:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:50:59,105 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2018-12-02 18:50:59,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 18:50:59,105 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-12-02 18:50:59,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:50:59,106 INFO L225 Difference]: With dead ends: 118 [2018-12-02 18:50:59,107 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 18:50:59,107 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-02 18:50:59,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 18:50:59,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-02 18:50:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 18:50:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-12-02 18:50:59,115 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 55 [2018-12-02 18:50:59,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:50:59,116 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-12-02 18:50:59,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 18:50:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-12-02 18:50:59,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 18:50:59,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:50:59,118 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:50:59,118 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:50:59,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1937391112, now seen corresponding path program 1 times [2018-12-02 18:50:59,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:50:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:59,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:50:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:59,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:50:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:50:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 26 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-02 18:50:59,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:50:59,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 18:50:59,168 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-12-02 18:50:59,168 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-02 18:50:59,169 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 18:50:59,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 18:50:59,452 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 18:50:59,452 INFO L272 AbstractInterpreter]: Visited 29 different actions 2572 times. Merged at 11 different actions 587 times. Widened at 2 different actions 135 times. Performed 5789 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5789 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 318 fixpoints after 9 different actions. Largest state had 5 variables. [2018-12-02 18:50:59,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:59,454 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 18:50:59,466 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 50% of their original sizes. [2018-12-02 18:50:59,466 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 18:50:59,522 INFO L418 sIntCurrentIteration]: We unified 79 AI predicates to 79 [2018-12-02 18:50:59,522 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 18:50:59,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 18:50:59,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-12-02 18:50:59,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:50:59,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 18:50:59,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 18:50:59,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 18:50:59,523 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 13 states. [2018-12-02 18:50:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:50:59,785 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2018-12-02 18:50:59,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 18:50:59,785 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-12-02 18:50:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:50:59,786 INFO L225 Difference]: With dead ends: 141 [2018-12-02 18:50:59,786 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 18:50:59,786 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-02 18:50:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 18:50:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-02 18:50:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 18:50:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-12-02 18:50:59,792 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 80 [2018-12-02 18:50:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:50:59,792 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-12-02 18:50:59,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 18:50:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-12-02 18:50:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 18:50:59,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:50:59,793 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:50:59,793 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:50:59,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:50:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1541382103, now seen corresponding path program 1 times [2018-12-02 18:50:59,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:50:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:50:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:50:59,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:50:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:50:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 55 proven. 13 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-12-02 18:50:59,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:50:59,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 18:50:59,836 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-12-02 18:50:59,836 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-02 18:50:59,837 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 18:50:59,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 18:51:00,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 18:51:00,280 INFO L272 AbstractInterpreter]: Visited 34 different actions 4844 times. Merged at 14 different actions 1434 times. Widened at 2 different actions 189 times. Performed 11827 root evaluator evaluations with a maximum evaluation depth of 4. Performed 11827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 615 fixpoints after 11 different actions. Largest state had 5 variables. [2018-12-02 18:51:00,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:51:00,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 18:51:00,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:51:00,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 18:51:00,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:51:00,299 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 18:51:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:51:00,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 18:51:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 18:51:00,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 18:51:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 72 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-02 18:51:00,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 18:51:00,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 13] total 17 [2018-12-02 18:51:00,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 18:51:00,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 18:51:00,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 18:51:00,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-12-02 18:51:00,891 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 12 states. [2018-12-02 18:51:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:51:01,065 INFO L93 Difference]: Finished difference Result 212 states and 335 transitions. [2018-12-02 18:51:01,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 18:51:01,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-02 18:51:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:51:01,066 INFO L225 Difference]: With dead ends: 212 [2018-12-02 18:51:01,066 INFO L226 Difference]: Without dead ends: 134 [2018-12-02 18:51:01,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 167 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-12-02 18:51:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-02 18:51:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2018-12-02 18:51:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 18:51:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2018-12-02 18:51:01,076 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 94 [2018-12-02 18:51:01,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:51:01,076 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2018-12-02 18:51:01,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 18:51:01,076 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2018-12-02 18:51:01,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 18:51:01,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:51:01,077 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:51:01,077 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:51:01,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:51:01,077 INFO L82 PathProgramCache]: Analyzing trace with hash 721741772, now seen corresponding path program 2 times [2018-12-02 18:51:01,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:51:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:51:01,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:51:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:51:01,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:51:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:51:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 72 proven. 54 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-02 18:51:01,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:51:01,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 18:51:01,158 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 18:51:01,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 18:51:01,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:51:01,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 18:51:01,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 18:51:01,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 18:51:01,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 18:51:01,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 18:51:01,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 18:51:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 78 proven. 17 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-02 18:51:01,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 18:51:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 78 proven. 19 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 18:51:01,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 18:51:01,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 18 [2018-12-02 18:51:01,437 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 18:51:01,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 18:51:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 18:51:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-12-02 18:51:01,438 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand 15 states. [2018-12-02 18:51:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:51:01,751 INFO L93 Difference]: Finished difference Result 231 states and 386 transitions. [2018-12-02 18:51:01,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 18:51:01,751 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 110 [2018-12-02 18:51:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:51:01,753 INFO L225 Difference]: With dead ends: 231 [2018-12-02 18:51:01,753 INFO L226 Difference]: Without dead ends: 165 [2018-12-02 18:51:01,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 207 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-12-02 18:51:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-02 18:51:01,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 144. [2018-12-02 18:51:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-02 18:51:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2018-12-02 18:51:01,765 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 110 [2018-12-02 18:51:01,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:51:01,766 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2018-12-02 18:51:01,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 18:51:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2018-12-02 18:51:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-02 18:51:01,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:51:01,768 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 13, 11, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:51:01,768 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:51:01,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:51:01,769 INFO L82 PathProgramCache]: Analyzing trace with hash -189273787, now seen corresponding path program 3 times [2018-12-02 18:51:01,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:51:01,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:51:01,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 18:51:01,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:51:01,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:51:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:51:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 234 proven. 21 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2018-12-02 18:51:01,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:51:01,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 18:51:01,879 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 18:51:01,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 18:51:01,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:51:01,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 18:51:01,889 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 18:51:01,889 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 18:51:01,919 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 18:51:01,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 18:51:01,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 18:51:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 185 proven. 205 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2018-12-02 18:51:02,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 18:51:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 183 proven. 215 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2018-12-02 18:51:02,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 18:51:02,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 14] total 24 [2018-12-02 18:51:02,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 18:51:02,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 18:51:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 18:51:02,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-12-02 18:51:02,675 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand 18 states. [2018-12-02 18:51:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:51:02,952 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2018-12-02 18:51:02,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 18:51:02,952 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 229 [2018-12-02 18:51:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:51:02,953 INFO L225 Difference]: With dead ends: 322 [2018-12-02 18:51:02,954 INFO L226 Difference]: Without dead ends: 175 [2018-12-02 18:51:02,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 433 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=921, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 18:51:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-02 18:51:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 156. [2018-12-02 18:51:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-02 18:51:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 233 transitions. [2018-12-02 18:51:02,970 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 233 transitions. Word has length 229 [2018-12-02 18:51:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:51:02,970 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 233 transitions. [2018-12-02 18:51:02,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 18:51:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 233 transitions. [2018-12-02 18:51:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 18:51:02,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:51:02,974 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:51:02,974 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:51:02,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:51:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1397185591, now seen corresponding path program 4 times [2018-12-02 18:51:02,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:51:02,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:51:02,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 18:51:02,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:51:02,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:51:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:51:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 160 proven. 18 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-12-02 18:51:03,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:51:03,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 18:51:03,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 18:51:03,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 18:51:03,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 18:51:03,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 18:51:03,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:51:03,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 18:51:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:51:03,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 18:51:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 80 proven. 97 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 18:51:03,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 18:51:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 80 proven. 102 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-12-02 18:51:03,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 18:51:03,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 18 [2018-12-02 18:51:03,550 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 18:51:03,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 18:51:03,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 18:51:03,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-02 18:51:03,550 INFO L87 Difference]: Start difference. First operand 156 states and 233 transitions. Second operand 14 states. [2018-12-02 18:51:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:51:03,777 INFO L93 Difference]: Finished difference Result 363 states and 610 transitions. [2018-12-02 18:51:03,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 18:51:03,778 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149 [2018-12-02 18:51:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:51:03,780 INFO L225 Difference]: With dead ends: 363 [2018-12-02 18:51:03,780 INFO L226 Difference]: Without dead ends: 192 [2018-12-02 18:51:03,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 283 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-12-02 18:51:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-02 18:51:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 149. [2018-12-02 18:51:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-02 18:51:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 206 transitions. [2018-12-02 18:51:03,795 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 206 transitions. Word has length 149 [2018-12-02 18:51:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:51:03,795 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 206 transitions. [2018-12-02 18:51:03,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 18:51:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 206 transitions. [2018-12-02 18:51:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 18:51:03,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:51:03,797 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:51:03,797 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:51:03,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:51:03,798 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 5 times [2018-12-02 18:51:03,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:51:03,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:51:03,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:51:03,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:51:03,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:51:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:51:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:51:03,840 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 18:51:03,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:51:03 BoogieIcfgContainer [2018-12-02 18:51:03,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 18:51:03,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 18:51:03,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 18:51:03,869 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 18:51:03,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:50:56" (3/4) ... [2018-12-02 18:51:03,870 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 18:51:03,920 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5e18ef25-08d6-4a53-92c5-2b2f44986d0a/bin-2019/utaipan/witness.graphml [2018-12-02 18:51:03,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 18:51:03,921 INFO L168 Benchmark]: Toolchain (without parser) took 7658.57 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 438.3 MB). Free memory was 958.8 MB in the beginning and 1.2 GB in the end (delta: -244.4 MB). Peak memory consumption was 193.9 MB. Max. memory is 11.5 GB. [2018-12-02 18:51:03,922 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 18:51:03,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 119.77 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 18:51:03,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.54 ms. Allocated memory is still 1.0 GB. Free memory is still 948.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 18:51:03,922 INFO L168 Benchmark]: Boogie Preprocessor took 10.47 ms. Allocated memory is still 1.0 GB. Free memory is still 948.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 18:51:03,922 INFO L168 Benchmark]: RCFGBuilder took 154.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-02 18:51:03,923 INFO L168 Benchmark]: TraceAbstraction took 7308.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 306.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.2 MB). Peak memory consumption was 215.0 MB. Max. memory is 11.5 GB. [2018-12-02 18:51:03,923 INFO L168 Benchmark]: Witness Printer took 51.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 18:51:03,924 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 119.77 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.54 ms. Allocated memory is still 1.0 GB. Free memory is still 948.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.47 ms. Allocated memory is still 1.0 GB. Free memory is still 948.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 154.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7308.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 306.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.2 MB). Peak memory consumption was 215.0 MB. Max. memory is 11.5 GB. * Witness Printer took 51.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 7.2s OverallTime, 12 OverallIterations, 17 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 395 SDtfs, 458 SDslu, 2587 SDs, 0 SdLazy, 1951 SolverSat, 390 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1584 GetRequests, 1351 SyntacticMatches, 46 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.8596938775510204 AbsIntWeakeningRatio, 0.5714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 0.20408163265306123 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 149 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1672 NumberOfCodeBlocks, 1570 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2108 ConstructedInterpolants, 0 QuantifiedInterpolants, 453682 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1167 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 21 InterpolantComputations, 2 PerfectInterpolantSequences, 6528/7495 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...