./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/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 7b225e80ee922ecd6d28f97f9a97339f737a7de4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-5842f4b [2018-11-18 18:03:35,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 18:03:35,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 18:03:35,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 18:03:35,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 18:03:35,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 18:03:35,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 18:03:35,839 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 18:03:35,839 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 18:03:35,840 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 18:03:35,841 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 18:03:35,841 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 18:03:35,842 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 18:03:35,842 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 18:03:35,843 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 18:03:35,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 18:03:35,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 18:03:35,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 18:03:35,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 18:03:35,848 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 18:03:35,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 18:03:35,849 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 18:03:35,851 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 18:03:35,851 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 18:03:35,851 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 18:03:35,852 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 18:03:35,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 18:03:35,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 18:03:35,854 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 18:03:35,854 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 18:03:35,854 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 18:03:35,855 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 18:03:35,855 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 18:03:35,855 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 18:03:35,856 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 18:03:35,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 18:03:35,857 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 18:03:35,867 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 18:03:35,867 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 18:03:35,868 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 18:03:35,868 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 18:03:35,868 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 18:03:35,868 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 18:03:35,868 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 18:03:35,869 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 18:03:35,869 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 18:03:35,869 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 18:03:35,869 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 18:03:35,869 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 18:03:35,869 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 18:03:35,870 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 18:03:35,870 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 18:03:35,870 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 18:03:35,870 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 18:03:35,870 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 18:03:35,870 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 18:03:35,871 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 18:03:35,871 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 18:03:35,871 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 18:03:35,871 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 18:03:35,871 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 18:03:35,871 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 18:03:35,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 18:03:35,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 18:03:35,872 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 18:03:35,872 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 18:03:35,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 18:03:35,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 18:03:35,872 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 18:03:35,873 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 18:03:35,873 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 18:03:35,873 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 18:03:35,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 18:03:35,873 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 18:03:35,873 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_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/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 -> 7b225e80ee922ecd6d28f97f9a97339f737a7de4 [2018-11-18 18:03:35,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 18:03:35,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 18:03:35,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 18:03:35,910 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 18:03:35,910 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 18:03:35,911 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-11-18 18:03:35,954 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/data/2ce5d3fdf/562523bcae8343e78c4024ce77746c8d/FLAG345d8183e [2018-11-18 18:03:36,290 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 18:03:36,290 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-11-18 18:03:36,295 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/data/2ce5d3fdf/562523bcae8343e78c4024ce77746c8d/FLAG345d8183e [2018-11-18 18:03:36,711 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/data/2ce5d3fdf/562523bcae8343e78c4024ce77746c8d [2018-11-18 18:03:36,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 18:03:36,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 18:03:36,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 18:03:36,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 18:03:36,717 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 18:03:36,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:03:36" (1/1) ... [2018-11-18 18:03:36,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1fc64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36, skipping insertion in model container [2018-11-18 18:03:36,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:03:36" (1/1) ... [2018-11-18 18:03:36,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 18:03:36,737 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 18:03:36,850 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:03:36,852 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 18:03:36,861 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:03:36,871 INFO L195 MainTranslator]: Completed translation [2018-11-18 18:03:36,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36 WrapperNode [2018-11-18 18:03:36,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 18:03:36,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 18:03:36,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 18:03:36,872 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 18:03:36,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36" (1/1) ... [2018-11-18 18:03:36,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36" (1/1) ... [2018-11-18 18:03:36,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 18:03:36,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 18:03:36,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 18:03:36,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 18:03:36,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36" (1/1) ... [2018-11-18 18:03:36,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36" (1/1) ... [2018-11-18 18:03:36,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36" (1/1) ... [2018-11-18 18:03:36,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36" (1/1) ... [2018-11-18 18:03:36,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36" (1/1) ... [2018-11-18 18:03:36,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36" (1/1) ... [2018-11-18 18:03:36,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36" (1/1) ... [2018-11-18 18:03:36,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 18:03:36,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 18:03:36,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 18:03:36,894 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 18:03:36,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 18:03:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 18:03:36,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 18:03:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 18:03:36,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 18:03:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 18:03:36,970 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 18:03:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-18 18:03:36,970 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-18 18:03:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-18 18:03:36,970 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-18 18:03:37,067 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 18:03:37,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:03:37 BoogieIcfgContainer [2018-11-18 18:03:37,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 18:03:37,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 18:03:37,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 18:03:37,070 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 18:03:37,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:03:36" (1/3) ... [2018-11-18 18:03:37,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d8b9e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:03:37, skipping insertion in model container [2018-11-18 18:03:37,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:03:36" (2/3) ... [2018-11-18 18:03:37,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d8b9e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:03:37, skipping insertion in model container [2018-11-18 18:03:37,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:03:37" (3/3) ... [2018-11-18 18:03:37,072 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10_false-unreach-call.c [2018-11-18 18:03:37,077 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 18:03:37,082 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 18:03:37,090 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 18:03:37,109 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 18:03:37,109 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 18:03:37,109 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 18:03:37,110 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 18:03:37,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 18:03:37,110 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 18:03:37,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 18:03:37,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 18:03:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-18 18:03:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 18:03:37,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:37,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:03:37,125 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:37,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:37,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-18 18:03:37,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:37,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:37,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:37,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:37,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:03:37,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 18:03:37,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 18:03:37,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:03:37,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 18:03:37,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 18:03:37,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 18:03:37,256 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-18 18:03:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:37,333 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-18 18:03:37,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 18:03:37,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 18:03:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:37,341 INFO L225 Difference]: With dead ends: 44 [2018-11-18 18:03:37,341 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 18:03:37,343 INFO L604 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-11-18 18:03:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 18:03:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 18:03:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 18:03:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-18 18:03:37,376 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-18 18:03:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:37,376 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 18:03:37,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 18:03:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-18 18:03:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 18:03:37,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:37,378 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:03:37,378 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:37,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:37,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-18 18:03:37,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:37,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:37,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:03:37,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 18:03:37,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 18:03:37,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:03:37,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 18:03:37,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 18:03:37,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 18:03:37,424 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-18 18:03:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:37,491 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-18 18:03:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 18:03:37,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 18:03:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:37,493 INFO L225 Difference]: With dead ends: 36 [2018-11-18 18:03:37,493 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 18:03:37,494 INFO L604 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-11-18 18:03:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 18:03:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 18:03:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 18:03:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-18 18:03:37,499 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-18 18:03:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:37,500 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 18:03:37,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 18:03:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-18 18:03:37,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 18:03:37,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:37,501 INFO L375 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-11-18 18:03:37,501 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:37,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:37,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-18 18:03:37,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:37,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:37,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:37,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:37,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 18:03:37,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:37,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:37,581 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-18 18:03:37,582 INFO L202 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-11-18 18:03:37,604 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:37,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:37,674 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 18:03:37,675 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-11-18 18:03:37,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:37,680 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 18:03:37,711 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 18:03:37,712 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 18:03:37,735 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-18 18:03:37,735 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 18:03:37,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 18:03:37,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-18 18:03:37,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:03:37,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 18:03:37,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 18:03:37,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 18:03:37,736 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-11-18 18:03:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:37,887 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-11-18 18:03:37,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 18:03:37,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-18 18:03:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:37,888 INFO L225 Difference]: With dead ends: 72 [2018-11-18 18:03:37,888 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 18:03:37,889 INFO L604 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-11-18 18:03:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 18:03:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-18 18:03:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 18:03:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-18 18:03:37,897 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-11-18 18:03:37,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:37,897 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-18 18:03:37,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 18:03:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 18:03:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 18:03:37,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:37,899 INFO L375 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-11-18 18:03:37,899 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:37,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:37,900 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-18 18:03:37,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:37,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:37,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:37,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:37,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 18:03:37,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:37,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:37,945 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-18 18:03:37,945 INFO L202 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-11-18 18:03:37,947 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:37,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:38,211 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 18:03:38,211 INFO L272 AbstractInterpreter]: Visited 28 different actions 896 times. Never merged. Widened at 4 different actions 65 times. Performed 1872 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1872 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 95 fixpoints after 6 different actions. Largest state had 5 variables. [2018-11-18 18:03:38,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:38,214 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 18:03:38,227 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 18:03:38,227 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 18:03:38,274 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-18 18:03:38,274 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 18:03:38,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 18:03:38,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-18 18:03:38,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:03:38,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 18:03:38,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 18:03:38,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 18:03:38,276 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-11-18 18:03:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:38,478 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-11-18 18:03:38,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 18:03:38,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-18 18:03:38,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:38,479 INFO L225 Difference]: With dead ends: 87 [2018-11-18 18:03:38,480 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 18:03:38,480 INFO L604 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-11-18 18:03:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 18:03:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-18 18:03:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 18:03:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-18 18:03:38,488 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-11-18 18:03:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:38,488 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-18 18:03:38,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 18:03:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-18 18:03:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 18:03:38,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:38,490 INFO L375 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-11-18 18:03:38,493 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:38,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:38,494 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-11-18 18:03:38,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:38,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:38,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:38,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:38,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 18:03:38,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:38,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:38,558 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:03:38,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:03:38,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:38,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:03:38,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 18:03:38,571 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 18:03:38,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 18:03:38,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:03:38,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:03:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 18:03:38,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:03:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 18:03:38,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:03:38,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-11-18 18:03:38,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:03:38,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 18:03:38,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 18:03:38,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-18 18:03:38,954 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-11-18 18:03:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:39,153 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-11-18 18:03:39,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 18:03:39,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-18 18:03:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:39,157 INFO L225 Difference]: With dead ends: 121 [2018-11-18 18:03:39,157 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 18:03:39,158 INFO L604 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-11-18 18:03:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 18:03:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-18 18:03:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 18:03:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-18 18:03:39,169 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-11-18 18:03:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:39,170 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-18 18:03:39,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 18:03:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-18 18:03:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 18:03:39,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:39,172 INFO L375 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-11-18 18:03:39,172 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:39,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:39,173 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-11-18 18:03:39,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:39,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:39,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:03:39,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:39,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 18:03:39,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:39,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:39,238 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-18 18:03:39,251 INFO L202 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-11-18 18:03:39,253 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:39,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:46,245 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 18:03:46,245 INFO L272 AbstractInterpreter]: Visited 29 different actions 61447 times. Merged at 11 different actions 16389 times. Widened at 4 different actions 3048 times. Performed 145554 root evaluator evaluations with a maximum evaluation depth of 4. Performed 145554 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7200 fixpoints after 10 different actions. Largest state had 5 variables. [2018-11-18 18:03:46,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:46,247 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 18:03:46,257 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 56.25% of their original sizes. [2018-11-18 18:03:46,257 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 18:03:46,319 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-18 18:03:46,320 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 18:03:46,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 18:03:46,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-11-18 18:03:46,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:03:46,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 18:03:46,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 18:03:46,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 18:03:46,321 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 13 states. [2018-11-18 18:03:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:46,588 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2018-11-18 18:03:46,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 18:03:46,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-11-18 18:03:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:46,590 INFO L225 Difference]: With dead ends: 118 [2018-11-18 18:03:46,590 INFO L226 Difference]: Without dead ends: 77 [2018-11-18 18:03:46,591 INFO L604 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-11-18 18:03:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-18 18:03:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-18 18:03:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-18 18:03:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-11-18 18:03:46,600 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 55 [2018-11-18 18:03:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:46,600 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-11-18 18:03:46,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 18:03:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-11-18 18:03:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 18:03:46,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:46,602 INFO L375 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-11-18 18:03:46,602 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:46,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:46,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1937391112, now seen corresponding path program 1 times [2018-11-18 18:03:46,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:46,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:46,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 26 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 18:03:46,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:46,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:46,675 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-11-18 18:03:46,675 INFO L202 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-11-18 18:03:46,676 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:46,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:48,246 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 18:03:48,247 INFO L272 AbstractInterpreter]: Visited 29 different actions 20375 times. Merged at 11 different actions 5233 times. Widened at 3 different actions 1140 times. Performed 47351 root evaluator evaluations with a maximum evaluation depth of 4. Performed 47351 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2539 fixpoints after 9 different actions. Largest state had 5 variables. [2018-11-18 18:03:48,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:48,250 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 18:03:48,260 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 18:03:48,260 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 18:03:48,310 INFO L415 sIntCurrentIteration]: We unified 79 AI predicates to 79 [2018-11-18 18:03:48,311 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 18:03:48,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 18:03:48,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-18 18:03:48,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:03:48,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 18:03:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 18:03:48,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 18:03:48,312 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 13 states. [2018-11-18 18:03:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:48,562 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2018-11-18 18:03:48,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 18:03:48,562 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-11-18 18:03:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:48,563 INFO L225 Difference]: With dead ends: 141 [2018-11-18 18:03:48,563 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 18:03:48,564 INFO L604 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-11-18 18:03:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 18:03:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-18 18:03:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-18 18:03:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-11-18 18:03:48,573 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 80 [2018-11-18 18:03:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:48,573 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-11-18 18:03:48,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 18:03:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-11-18 18:03:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 18:03:48,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:48,575 INFO L375 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-11-18 18:03:48,575 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:48,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1541382103, now seen corresponding path program 1 times [2018-11-18 18:03:48,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:48,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:48,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:48,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:48,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 55 proven. 13 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-18 18:03:48,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:48,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:48,636 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-11-18 18:03:48,636 INFO L202 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-11-18 18:03:48,637 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:48,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:07:53,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 18:07:53,862 INFO L272 AbstractInterpreter]: Visited 34 different actions 2187402 times. Merged at 14 different actions 690652 times. Widened at 4 different actions 72333 times. Performed 5379739 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5379739 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 310049 fixpoints after 10 different actions. Largest state had 5 variables. [2018-11-18 18:07:53,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:07:53,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 18:07:53,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:07:53,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:07:53,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:07:53,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 18:07:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:07:53,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:07:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 23 proven. 81 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 18:07:53,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:07:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 23 proven. 97 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-18 18:07:54,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:07:54,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 21 [2018-11-18 18:07:54,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:07:54,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 18:07:54,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 18:07:54,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-11-18 18:07:54,659 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 14 states. [2018-11-18 18:07:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:07:54,868 INFO L93 Difference]: Finished difference Result 231 states and 393 transitions. [2018-11-18 18:07:54,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 18:07:54,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2018-11-18 18:07:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:07:54,870 INFO L225 Difference]: With dead ends: 231 [2018-11-18 18:07:54,870 INFO L226 Difference]: Without dead ends: 143 [2018-11-18 18:07:54,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 162 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2018-11-18 18:07:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-18 18:07:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2018-11-18 18:07:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-18 18:07:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2018-11-18 18:07:54,887 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 94 [2018-11-18 18:07:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:07:54,887 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2018-11-18 18:07:54,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 18:07:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2018-11-18 18:07:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 18:07:54,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:07:54,889 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 11, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:07:54,889 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:07:54,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:07:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash -334045017, now seen corresponding path program 1 times [2018-11-18 18:07:54,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:07:54,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:07:54,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:07:54,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:07:54,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:07:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:07:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 99 proven. 184 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-11-18 18:07:55,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:07:55,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:07:55,034 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-18 18:07:55,034 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [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-11-18 18:07:55,035 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:07:55,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:07:57,196 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 18:07:57,196 INFO L272 AbstractInterpreter]: Visited 29 different actions 27744 times. Merged at 11 different actions 6710 times. Widened at 4 different actions 1741 times. Performed 67575 root evaluator evaluations with a maximum evaluation depth of 4. Performed 67575 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3522 fixpoints after 9 different actions. Largest state had 5 variables. [2018-11-18 18:07:57,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:07:57,201 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 18:07:57,218 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 56.31% of their original sizes. [2018-11-18 18:07:57,218 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 18:07:57,350 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-18 18:07:57,351 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 18:07:57,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 18:07:57,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [11] total 33 [2018-11-18 18:07:57,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:07:57,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 18:07:57,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 18:07:57,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-11-18 18:07:57,352 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand 24 states. [2018-11-18 18:07:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:07:58,054 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2018-11-18 18:07:58,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 18:07:58,054 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-18 18:07:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:07:58,055 INFO L225 Difference]: With dead ends: 223 [2018-11-18 18:07:58,056 INFO L226 Difference]: Without dead ends: 153 [2018-11-18 18:07:58,056 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 18:07:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-18 18:07:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2018-11-18 18:07:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-18 18:07:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 162 transitions. [2018-11-18 18:07:58,070 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 162 transitions. Word has length 175 [2018-11-18 18:07:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:07:58,071 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 162 transitions. [2018-11-18 18:07:58,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 18:07:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-11-18 18:07:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-18 18:07:58,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:07:58,073 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 13, 12, 12, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:07:58,073 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:07:58,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:07:58,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1327733822, now seen corresponding path program 2 times [2018-11-18 18:07:58,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:07:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:07:58,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:07:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:07:58,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:07:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:07:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 286 proven. 12 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-11-18 18:07:58,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:07:58,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:07:58,241 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:07:58,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:07:58,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:07:58,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:07:58,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 18:07:58,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 18:07:58,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 18:07:58,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:07:58,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:07:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 301 proven. 3 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2018-11-18 18:07:58,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:07:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 223 proven. 5 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2018-11-18 18:07:58,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:07:58,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2018-11-18 18:07:58,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:07:58,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 18:07:58,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 18:07:58,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-18 18:07:58,700 INFO L87 Difference]: Start difference. First operand 127 states and 162 transitions. Second operand 16 states. [2018-11-18 18:07:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:07:58,868 INFO L93 Difference]: Finished difference Result 255 states and 402 transitions. [2018-11-18 18:07:58,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 18:07:58,868 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 215 [2018-11-18 18:07:58,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:07:58,870 INFO L225 Difference]: With dead ends: 255 [2018-11-18 18:07:58,870 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 18:07:58,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 418 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2018-11-18 18:07:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 18:07:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2018-11-18 18:07:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 18:07:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 199 transitions. [2018-11-18 18:07:58,884 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 199 transitions. Word has length 215 [2018-11-18 18:07:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:07:58,884 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 199 transitions. [2018-11-18 18:07:58,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 18:07:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 199 transitions. [2018-11-18 18:07:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-18 18:07:58,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:07:58,890 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 18, 18, 18, 16, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:07:58,890 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:07:58,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:07:58,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1249336471, now seen corresponding path program 2 times [2018-11-18 18:07:58,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:07:58,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:07:58,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:07:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:07:58,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:07:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:07:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2261 backedges. 266 proven. 272 refuted. 0 times theorem prover too weak. 1723 trivial. 0 not checked. [2018-11-18 18:07:59,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:07:59,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:07:59,025 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:07:59,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:07:59,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:07:59,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:07:59,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 18:07:59,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 18:07:59,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 18:07:59,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:07:59,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:07:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2261 backedges. 526 proven. 36 refuted. 0 times theorem prover too weak. 1699 trivial. 0 not checked. [2018-11-18 18:07:59,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:07:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2261 backedges. 526 proven. 38 refuted. 0 times theorem prover too weak. 1697 trivial. 0 not checked. [2018-11-18 18:07:59,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:07:59,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 23 [2018-11-18 18:07:59,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:07:59,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 18:07:59,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 18:07:59,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-11-18 18:07:59,805 INFO L87 Difference]: Start difference. First operand 140 states and 199 transitions. Second operand 18 states. [2018-11-18 18:08:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:00,203 INFO L93 Difference]: Finished difference Result 332 states and 608 transitions. [2018-11-18 18:08:00,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 18:08:00,203 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 287 [2018-11-18 18:08:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:00,205 INFO L225 Difference]: With dead ends: 332 [2018-11-18 18:08:00,205 INFO L226 Difference]: Without dead ends: 215 [2018-11-18 18:08:00,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 553 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 18:08:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-18 18:08:00,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2018-11-18 18:08:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-18 18:08:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 307 transitions. [2018-11-18 18:08:00,223 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 307 transitions. Word has length 287 [2018-11-18 18:08:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:00,223 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 307 transitions. [2018-11-18 18:08:00,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 18:08:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 307 transitions. [2018-11-18 18:08:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-18 18:08:00,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:00,225 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 20, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:00,225 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:00,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:00,225 INFO L82 PathProgramCache]: Analyzing trace with hash -912125929, now seen corresponding path program 3 times [2018-11-18 18:08:00,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:00,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:00,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:08:00,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:00,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 237 proven. 169 refuted. 0 times theorem prover too weak. 2039 trivial. 0 not checked. [2018-11-18 18:08:00,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:00,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:00,344 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:00,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:00,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:00,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:00,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 18:08:00,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 18:08:00,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 18:08:00,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:08:00,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 112 proven. 564 refuted. 0 times theorem prover too weak. 1769 trivial. 0 not checked. [2018-11-18 18:08:00,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 112 proven. 588 refuted. 0 times theorem prover too weak. 1745 trivial. 0 not checked. [2018-11-18 18:08:01,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:01,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 17] total 23 [2018-11-18 18:08:01,567 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:01,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 18:08:01,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 18:08:01,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-11-18 18:08:01,567 INFO L87 Difference]: Start difference. First operand 197 states and 307 transitions. Second operand 15 states. [2018-11-18 18:08:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:01,835 INFO L93 Difference]: Finished difference Result 526 states and 1013 transitions. [2018-11-18 18:08:01,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 18:08:01,836 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 287 [2018-11-18 18:08:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:01,839 INFO L225 Difference]: With dead ends: 526 [2018-11-18 18:08:01,839 INFO L226 Difference]: Without dead ends: 318 [2018-11-18 18:08:01,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 546 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 18:08:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-11-18 18:08:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 224. [2018-11-18 18:08:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-18 18:08:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 352 transitions. [2018-11-18 18:08:01,858 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 352 transitions. Word has length 287 [2018-11-18 18:08:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:01,858 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 352 transitions. [2018-11-18 18:08:01,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 18:08:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 352 transitions. [2018-11-18 18:08:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-18 18:08:01,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:01,861 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 19, 18, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:01,861 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:01,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash 251019707, now seen corresponding path program 2 times [2018-11-18 18:08:01,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:01,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:01,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:08:01,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:01,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 322 proven. 4 refuted. 0 times theorem prover too weak. 2374 trivial. 0 not checked. [2018-11-18 18:08:01,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:01,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:01,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:01,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:01,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:01,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:01,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 18:08:01,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 18:08:01,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 18:08:01,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:08:01,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 322 proven. 4 refuted. 0 times theorem prover too weak. 2374 trivial. 0 not checked. [2018-11-18 18:08:02,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 322 proven. 4 refuted. 0 times theorem prover too weak. 2374 trivial. 0 not checked. [2018-11-18 18:08:02,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:02,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2018-11-18 18:08:02,392 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:02,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 18:08:02,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 18:08:02,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 18:08:02,393 INFO L87 Difference]: Start difference. First operand 224 states and 352 transitions. Second operand 7 states. [2018-11-18 18:08:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:02,478 INFO L93 Difference]: Finished difference Result 415 states and 695 transitions. [2018-11-18 18:08:02,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 18:08:02,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 314 [2018-11-18 18:08:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:02,482 INFO L225 Difference]: With dead ends: 415 [2018-11-18 18:08:02,482 INFO L226 Difference]: Without dead ends: 220 [2018-11-18 18:08:02,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 622 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-18 18:08:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-18 18:08:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-18 18:08:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-18 18:08:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 324 transitions. [2018-11-18 18:08:02,495 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 324 transitions. Word has length 314 [2018-11-18 18:08:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:02,496 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 324 transitions. [2018-11-18 18:08:02,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 18:08:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 324 transitions. [2018-11-18 18:08:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-18 18:08:02,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:02,498 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 22, 22, 20, 18, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 9, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:02,498 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:02,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:02,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1086306760, now seen corresponding path program 3 times [2018-11-18 18:08:02,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:02,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:08:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:02,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 426 proven. 141 refuted. 0 times theorem prover too weak. 2384 trivial. 0 not checked. [2018-11-18 18:08:02,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:02,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:02,596 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:02,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:02,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:02,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:02,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 18:08:02,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 18:08:02,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 18:08:02,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:08:02,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 130 proven. 729 refuted. 0 times theorem prover too weak. 2092 trivial. 0 not checked. [2018-11-18 18:08:02,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 130 proven. 762 refuted. 0 times theorem prover too weak. 2059 trivial. 0 not checked. [2018-11-18 18:08:04,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:04,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 19] total 24 [2018-11-18 18:08:04,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:04,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 18:08:04,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 18:08:04,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-11-18 18:08:04,017 INFO L87 Difference]: Start difference. First operand 220 states and 324 transitions. Second operand 15 states. [2018-11-18 18:08:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:04,193 INFO L93 Difference]: Finished difference Result 386 states and 733 transitions. [2018-11-18 18:08:04,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 18:08:04,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 327 [2018-11-18 18:08:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:04,197 INFO L225 Difference]: With dead ends: 386 [2018-11-18 18:08:04,197 INFO L226 Difference]: Without dead ends: 349 [2018-11-18 18:08:04,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 628 SyntacticMatches, 16 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 18:08:04,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-18 18:08:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 244. [2018-11-18 18:08:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-18 18:08:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 379 transitions. [2018-11-18 18:08:04,226 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 379 transitions. Word has length 327 [2018-11-18 18:08:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:04,226 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 379 transitions. [2018-11-18 18:08:04,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 18:08:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 379 transitions. [2018-11-18 18:08:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-18 18:08:04,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:04,231 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 28, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 12, 9, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:04,231 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:04,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:04,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1821894950, now seen corresponding path program 4 times [2018-11-18 18:08:04,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:04,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:08:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:04,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 307 proven. 1000 refuted. 0 times theorem prover too weak. 4776 trivial. 0 not checked. [2018-11-18 18:08:04,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:04,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:04,471 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:04,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:04,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:04,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:04,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:08:04,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 18:08:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:04,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 203 proven. 1246 refuted. 0 times theorem prover too weak. 4634 trivial. 0 not checked. [2018-11-18 18:08:04,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 203 proven. 1290 refuted. 0 times theorem prover too weak. 4590 trivial. 0 not checked. [2018-11-18 18:08:06,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:06,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 21] total 32 [2018-11-18 18:08:06,598 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:06,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 18:08:06,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 18:08:06,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2018-11-18 18:08:06,599 INFO L87 Difference]: Start difference. First operand 244 states and 379 transitions. Second operand 23 states. [2018-11-18 18:08:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:07,347 INFO L93 Difference]: Finished difference Result 659 states and 1270 transitions. [2018-11-18 18:08:07,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-18 18:08:07,348 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 463 [2018-11-18 18:08:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:07,351 INFO L225 Difference]: With dead ends: 659 [2018-11-18 18:08:07,351 INFO L226 Difference]: Without dead ends: 378 [2018-11-18 18:08:07,355 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 891 SyntacticMatches, 19 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=650, Invalid=3382, Unknown=0, NotChecked=0, Total=4032 [2018-11-18 18:08:07,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-18 18:08:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 349. [2018-11-18 18:08:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-11-18 18:08:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 573 transitions. [2018-11-18 18:08:07,385 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 573 transitions. Word has length 463 [2018-11-18 18:08:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:07,386 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 573 transitions. [2018-11-18 18:08:07,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 18:08:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 573 transitions. [2018-11-18 18:08:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2300 [2018-11-18 18:08:07,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:07,415 INFO L375 BasicCegarLoop]: trace histogram [182, 182, 155, 155, 138, 132, 91, 91, 91, 91, 91, 91, 91, 77, 77, 77, 77, 77, 77, 77, 61, 44, 41, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:07,416 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:07,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:07,416 INFO L82 PathProgramCache]: Analyzing trace with hash 376968825, now seen corresponding path program 5 times [2018-11-18 18:08:07,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:07,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:07,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:08:07,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:07,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 159807 backedges. 5769 proven. 2768 refuted. 0 times theorem prover too weak. 151270 trivial. 0 not checked. [2018-11-18 18:08:09,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:09,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:09,183 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:09,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:09,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:09,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:09,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 18:08:09,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 18:08:09,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-18 18:08:09,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:08:09,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 159807 backedges. 27298 proven. 41 refuted. 0 times theorem prover too weak. 132468 trivial. 0 not checked. [2018-11-18 18:08:10,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 159807 backedges. 6579 proven. 471 refuted. 0 times theorem prover too weak. 152757 trivial. 0 not checked. [2018-11-18 18:08:15,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:15,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 13] total 30 [2018-11-18 18:08:15,057 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:15,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 18:08:15,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 18:08:15,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2018-11-18 18:08:15,059 INFO L87 Difference]: Start difference. First operand 349 states and 573 transitions. Second operand 24 states. [2018-11-18 18:08:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:15,715 INFO L93 Difference]: Finished difference Result 827 states and 1619 transitions. [2018-11-18 18:08:15,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 18:08:15,715 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2299 [2018-11-18 18:08:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:15,719 INFO L225 Difference]: With dead ends: 827 [2018-11-18 18:08:15,720 INFO L226 Difference]: Without dead ends: 505 [2018-11-18 18:08:15,722 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4638 GetRequests, 4582 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1882, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 18:08:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-11-18 18:08:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 432. [2018-11-18 18:08:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-11-18 18:08:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 701 transitions. [2018-11-18 18:08:15,749 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 701 transitions. Word has length 2299 [2018-11-18 18:08:15,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:15,750 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 701 transitions. [2018-11-18 18:08:15,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 18:08:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 701 transitions. [2018-11-18 18:08:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2568 [2018-11-18 18:08:15,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:15,773 INFO L375 BasicCegarLoop]: trace histogram [200, 200, 175, 175, 165, 145, 100, 100, 100, 100, 100, 100, 100, 87, 87, 87, 87, 87, 87, 87, 65, 58, 55, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:15,773 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:15,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:15,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1240897778, now seen corresponding path program 6 times [2018-11-18 18:08:15,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:15,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:15,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:08:15,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:15,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 199234 backedges. 1581 proven. 6591 refuted. 0 times theorem prover too weak. 191062 trivial. 0 not checked. [2018-11-18 18:08:17,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:17,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:17,646 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:17,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:17,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:17,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:17,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 18:08:17,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 18:08:17,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 18:08:17,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:08:17,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 199234 backedges. 1524 proven. 8058 refuted. 0 times theorem prover too weak. 189652 trivial. 0 not checked. [2018-11-18 18:08:19,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 199234 backedges. 1524 proven. 8098 refuted. 0 times theorem prover too weak. 189612 trivial. 0 not checked. [2018-11-18 18:08:25,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:25,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 22] total 33 [2018-11-18 18:08:25,381 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:25,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 18:08:25,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 18:08:25,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 18:08:25,382 INFO L87 Difference]: Start difference. First operand 432 states and 701 transitions. Second operand 23 states. [2018-11-18 18:08:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:26,114 INFO L93 Difference]: Finished difference Result 1146 states and 2479 transitions. [2018-11-18 18:08:26,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 18:08:26,115 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 2567 [2018-11-18 18:08:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:26,119 INFO L225 Difference]: With dead ends: 1146 [2018-11-18 18:08:26,119 INFO L226 Difference]: Without dead ends: 371 [2018-11-18 18:08:26,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5164 GetRequests, 5095 SyntacticMatches, 20 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=439, Invalid=2111, Unknown=0, NotChecked=0, Total=2550 [2018-11-18 18:08:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-18 18:08:26,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 338. [2018-11-18 18:08:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-18 18:08:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 485 transitions. [2018-11-18 18:08:26,155 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 485 transitions. Word has length 2567 [2018-11-18 18:08:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:26,155 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 485 transitions. [2018-11-18 18:08:26,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 18:08:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 485 transitions. [2018-11-18 18:08:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1295 [2018-11-18 18:08:26,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:26,167 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 90, 90, 79, 74, 49, 49, 49, 49, 49, 49, 49, 45, 45, 45, 45, 45, 45, 45, 34, 25, 20, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:26,167 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:26,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash -753498443, now seen corresponding path program 7 times [2018-11-18 18:08:26,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:26,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:08:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:26,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 49870 backedges. 802 proven. 4226 refuted. 0 times theorem prover too weak. 44842 trivial. 0 not checked. [2018-11-18 18:08:26,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:26,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:26,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:26,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:26,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:26,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:26,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:08:26,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 18:08:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:27,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 49870 backedges. 733 proven. 3278 refuted. 0 times theorem prover too weak. 45859 trivial. 0 not checked. [2018-11-18 18:08:27,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 49870 backedges. 735 proven. 3309 refuted. 0 times theorem prover too weak. 45826 trivial. 0 not checked. [2018-11-18 18:08:30,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:30,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 19] total 31 [2018-11-18 18:08:30,369 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:30,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 18:08:30,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 18:08:30,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2018-11-18 18:08:30,370 INFO L87 Difference]: Start difference. First operand 338 states and 485 transitions. Second operand 23 states. [2018-11-18 18:08:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:31,048 INFO L93 Difference]: Finished difference Result 668 states and 1037 transitions. [2018-11-18 18:08:31,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-18 18:08:31,049 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1294 [2018-11-18 18:08:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:31,052 INFO L225 Difference]: With dead ends: 668 [2018-11-18 18:08:31,052 INFO L226 Difference]: Without dead ends: 350 [2018-11-18 18:08:31,054 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2637 GetRequests, 2560 SyntacticMatches, 17 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=587, Invalid=3195, Unknown=0, NotChecked=0, Total=3782 [2018-11-18 18:08:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-18 18:08:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 326. [2018-11-18 18:08:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-11-18 18:08:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 433 transitions. [2018-11-18 18:08:31,080 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 433 transitions. Word has length 1294 [2018-11-18 18:08:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:31,080 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 433 transitions. [2018-11-18 18:08:31,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 18:08:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 433 transitions. [2018-11-18 18:08:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2018-11-18 18:08:31,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:31,089 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 76, 76, 68, 64, 43, 43, 43, 43, 43, 43, 43, 38, 38, 38, 38, 38, 38, 38, 30, 21, 19, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:31,089 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:31,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1858987032, now seen corresponding path program 8 times [2018-11-18 18:08:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:31,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:31,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:08:31,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:31,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 37082 backedges. 1826 proven. 1766 refuted. 0 times theorem prover too weak. 33490 trivial. 0 not checked. [2018-11-18 18:08:31,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:31,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:31,751 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:31,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:31,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:31,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:31,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 18:08:31,758 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 18:08:31,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-18 18:08:31,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:08:31,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 37082 backedges. 8770 proven. 157 refuted. 0 times theorem prover too weak. 28155 trivial. 0 not checked. [2018-11-18 18:08:32,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 37082 backedges. 2708 proven. 422 refuted. 0 times theorem prover too weak. 33952 trivial. 0 not checked. [2018-11-18 18:08:33,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:33,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 29 [2018-11-18 18:08:33,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:33,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 18:08:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 18:08:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2018-11-18 18:08:33,891 INFO L87 Difference]: Start difference. First operand 326 states and 433 transitions. Second operand 23 states. [2018-11-18 18:08:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:34,468 INFO L93 Difference]: Finished difference Result 683 states and 953 transitions. [2018-11-18 18:08:34,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 18:08:34,469 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1117 [2018-11-18 18:08:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:34,471 INFO L225 Difference]: With dead ends: 683 [2018-11-18 18:08:34,471 INFO L226 Difference]: Without dead ends: 375 [2018-11-18 18:08:34,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2280 GetRequests, 2210 SyntacticMatches, 13 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=522, Invalid=2900, Unknown=0, NotChecked=0, Total=3422 [2018-11-18 18:08:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-18 18:08:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 341. [2018-11-18 18:08:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-18 18:08:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 440 transitions. [2018-11-18 18:08:34,488 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 440 transitions. Word has length 1117 [2018-11-18 18:08:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:34,488 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 440 transitions. [2018-11-18 18:08:34,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 18:08:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 440 transitions. [2018-11-18 18:08:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-11-18 18:08:34,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:34,494 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 74, 74, 61, 61, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 24, 23, 16, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:34,494 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:34,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1162202364, now seen corresponding path program 9 times [2018-11-18 18:08:34,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:34,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:34,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:08:34,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:34,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 31644 backedges. 986 proven. 3704 refuted. 0 times theorem prover too weak. 26954 trivial. 0 not checked. [2018-11-18 18:08:34,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:34,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:34,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:34,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:34,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:34,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:34,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 18:08:34,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 18:08:35,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 18:08:35,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:08:35,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 31644 backedges. 984 proven. 2187 refuted. 0 times theorem prover too weak. 28473 trivial. 0 not checked. [2018-11-18 18:08:35,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 31644 backedges. 988 proven. 2216 refuted. 0 times theorem prover too weak. 28440 trivial. 0 not checked. [2018-11-18 18:08:37,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:37,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 19] total 34 [2018-11-18 18:08:37,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:37,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 18:08:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 18:08:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 18:08:37,506 INFO L87 Difference]: Start difference. First operand 341 states and 440 transitions. Second operand 26 states. [2018-11-18 18:08:38,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:38,377 INFO L93 Difference]: Finished difference Result 624 states and 828 transitions. [2018-11-18 18:08:38,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-18 18:08:38,378 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1035 [2018-11-18 18:08:38,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:38,379 INFO L225 Difference]: With dead ends: 624 [2018-11-18 18:08:38,380 INFO L226 Difference]: Without dead ends: 382 [2018-11-18 18:08:38,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2136 GetRequests, 2045 SyntacticMatches, 17 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1554 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=810, Invalid=4890, Unknown=0, NotChecked=0, Total=5700 [2018-11-18 18:08:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-18 18:08:38,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 351. [2018-11-18 18:08:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-18 18:08:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 450 transitions. [2018-11-18 18:08:38,409 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 450 transitions. Word has length 1035 [2018-11-18 18:08:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:38,409 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 450 transitions. [2018-11-18 18:08:38,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 18:08:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 450 transitions. [2018-11-18 18:08:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-11-18 18:08:38,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:38,416 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 55, 54, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 22, 20, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:38,416 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:38,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:38,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1329713436, now seen corresponding path program 10 times [2018-11-18 18:08:38,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:38,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:38,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:08:38,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:38,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25228 backedges. 1835 proven. 630 refuted. 0 times theorem prover too weak. 22763 trivial. 0 not checked. [2018-11-18 18:08:38,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:38,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:38,896 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:38,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:38,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:38,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:38,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:08:38,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 18:08:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:39,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 25228 backedges. 1476 proven. 1343 refuted. 0 times theorem prover too weak. 22409 trivial. 0 not checked. [2018-11-18 18:08:39,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 25228 backedges. 1480 proven. 1372 refuted. 0 times theorem prover too weak. 22376 trivial. 0 not checked. [2018-11-18 18:08:41,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:41,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 19] total 23 [2018-11-18 18:08:41,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:41,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 18:08:41,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 18:08:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-11-18 18:08:41,309 INFO L87 Difference]: Start difference. First operand 351 states and 450 transitions. Second operand 15 states. [2018-11-18 18:08:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:41,459 INFO L93 Difference]: Finished difference Result 371 states and 475 transitions. [2018-11-18 18:08:41,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 18:08:41,459 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 926 [2018-11-18 18:08:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:41,462 INFO L225 Difference]: With dead ends: 371 [2018-11-18 18:08:41,462 INFO L226 Difference]: Without dead ends: 354 [2018-11-18 18:08:41,462 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1878 GetRequests, 1830 SyntacticMatches, 17 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 18:08:41,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-18 18:08:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2018-11-18 18:08:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-18 18:08:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 442 transitions. [2018-11-18 18:08:41,489 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 442 transitions. Word has length 926 [2018-11-18 18:08:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:41,490 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 442 transitions. [2018-11-18 18:08:41,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 18:08:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 442 transitions. [2018-11-18 18:08:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2018-11-18 18:08:41,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:41,498 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 75, 75, 63, 62, 40, 40, 40, 40, 40, 40, 40, 37, 37, 37, 37, 37, 37, 37, 26, 22, 17, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:41,498 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:41,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:41,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2035244028, now seen corresponding path program 11 times [2018-11-18 18:08:41,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:41,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:41,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:08:41,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:41,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 33368 backedges. 2276 proven. 1688 refuted. 0 times theorem prover too weak. 29404 trivial. 0 not checked. [2018-11-18 18:08:42,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:42,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:42,057 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:42,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:42,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:42,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:42,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 18:08:42,064 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 18:08:42,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-18 18:08:42,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:08:42,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 33368 backedges. 8731 proven. 145 refuted. 0 times theorem prover too weak. 24492 trivial. 0 not checked. [2018-11-18 18:08:42,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 33368 backedges. 2959 proven. 453 refuted. 0 times theorem prover too weak. 29956 trivial. 0 not checked. [2018-11-18 18:08:44,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:44,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 17] total 28 [2018-11-18 18:08:44,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:44,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 18:08:44,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 18:08:44,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2018-11-18 18:08:44,358 INFO L87 Difference]: Start difference. First operand 351 states and 442 transitions. Second operand 21 states. [2018-11-18 18:08:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:44,765 INFO L93 Difference]: Finished difference Result 583 states and 743 transitions. [2018-11-18 18:08:44,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 18:08:44,765 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1062 [2018-11-18 18:08:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:44,768 INFO L225 Difference]: With dead ends: 583 [2018-11-18 18:08:44,768 INFO L226 Difference]: Without dead ends: 377 [2018-11-18 18:08:44,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2163 GetRequests, 2103 SyntacticMatches, 15 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=345, Invalid=1817, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 18:08:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-11-18 18:08:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 353. [2018-11-18 18:08:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-11-18 18:08:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 436 transitions. [2018-11-18 18:08:44,799 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 436 transitions. Word has length 1062 [2018-11-18 18:08:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:44,800 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 436 transitions. [2018-11-18 18:08:44,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 18:08:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 436 transitions. [2018-11-18 18:08:44,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1145 [2018-11-18 18:08:44,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:44,809 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 68, 67, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 26, 26, 17, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:44,809 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:44,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:44,809 INFO L82 PathProgramCache]: Analyzing trace with hash 980558134, now seen corresponding path program 12 times [2018-11-18 18:08:44,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:44,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:44,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:08:44,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:44,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 4072 proven. 821 refuted. 0 times theorem prover too weak. 33876 trivial. 0 not checked. [2018-11-18 18:08:45,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:45,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:45,420 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:45,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:45,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:45,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:45,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 18:08:45,427 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 18:08:45,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 18:08:45,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:08:45,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 2691 proven. 394 refuted. 0 times theorem prover too weak. 35684 trivial. 0 not checked. [2018-11-18 18:08:45,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 2699 proven. 410 refuted. 0 times theorem prover too weak. 35660 trivial. 0 not checked. [2018-11-18 18:08:47,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:47,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 17] total 32 [2018-11-18 18:08:47,911 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:47,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 18:08:47,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 18:08:47,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-11-18 18:08:47,912 INFO L87 Difference]: Start difference. First operand 353 states and 436 transitions. Second operand 25 states. [2018-11-18 18:08:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:48,669 INFO L93 Difference]: Finished difference Result 705 states and 903 transitions. [2018-11-18 18:08:48,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-18 18:08:48,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1144 [2018-11-18 18:08:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:48,672 INFO L225 Difference]: With dead ends: 705 [2018-11-18 18:08:48,672 INFO L226 Difference]: Without dead ends: 446 [2018-11-18 18:08:48,673 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2349 GetRequests, 2267 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=658, Invalid=4034, Unknown=0, NotChecked=0, Total=4692 [2018-11-18 18:08:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-18 18:08:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 378. [2018-11-18 18:08:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-11-18 18:08:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 467 transitions. [2018-11-18 18:08:48,692 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 467 transitions. Word has length 1144 [2018-11-18 18:08:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:48,694 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 467 transitions. [2018-11-18 18:08:48,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 18:08:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 467 transitions. [2018-11-18 18:08:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1458 [2018-11-18 18:08:48,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:48,704 INFO L375 BasicCegarLoop]: trace histogram [107, 107, 106, 106, 86, 86, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 33, 33, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:48,704 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:48,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:48,705 INFO L82 PathProgramCache]: Analyzing trace with hash 260073237, now seen corresponding path program 13 times [2018-11-18 18:08:48,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:48,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:08:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:48,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 63278 backedges. 1182 proven. 5900 refuted. 0 times theorem prover too weak. 56196 trivial. 0 not checked. [2018-11-18 18:08:49,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:49,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:49,484 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:49,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:49,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:49,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:49,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:08:49,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 18:08:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:49,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 63278 backedges. 1173 proven. 4146 refuted. 0 times theorem prover too weak. 57959 trivial. 0 not checked. [2018-11-18 18:08:50,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 63278 backedges. 1171 proven. 4188 refuted. 0 times theorem prover too weak. 57919 trivial. 0 not checked. [2018-11-18 18:08:53,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:53,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 22] total 36 [2018-11-18 18:08:53,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:53,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 18:08:53,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 18:08:53,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 18:08:53,805 INFO L87 Difference]: Start difference. First operand 378 states and 467 transitions. Second operand 26 states. [2018-11-18 18:08:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:54,454 INFO L93 Difference]: Finished difference Result 691 states and 867 transitions. [2018-11-18 18:08:54,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 18:08:54,454 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1457 [2018-11-18 18:08:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:54,456 INFO L225 Difference]: With dead ends: 691 [2018-11-18 18:08:54,456 INFO L226 Difference]: Without dead ends: 386 [2018-11-18 18:08:54,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2966 GetRequests, 2884 SyntacticMatches, 20 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=611, Invalid=3421, Unknown=0, NotChecked=0, Total=4032 [2018-11-18 18:08:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-11-18 18:08:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 326. [2018-11-18 18:08:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-11-18 18:08:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 396 transitions. [2018-11-18 18:08:54,473 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 396 transitions. Word has length 1457 [2018-11-18 18:08:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:54,474 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 396 transitions. [2018-11-18 18:08:54,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 18:08:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 396 transitions. [2018-11-18 18:08:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1390 [2018-11-18 18:08:54,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:54,482 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 82, 82, 51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 50, 32, 31, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:54,482 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:54,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:54,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1927837140, now seen corresponding path program 14 times [2018-11-18 18:08:54,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:54,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:54,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:08:54,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:54,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:08:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 2149 proven. 6053 refuted. 0 times theorem prover too weak. 49244 trivial. 0 not checked. [2018-11-18 18:08:55,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:55,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:08:55,230 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 18:08:55,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 18:08:55,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:08:55,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:08:55,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 18:08:55,239 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 18:08:55,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) [2018-11-18 18:08:55,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 18:08:55,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:08:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 2127 proven. 1652 refuted. 0 times theorem prover too weak. 53667 trivial. 0 not checked. [2018-11-18 18:08:56,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:08:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 2131 proven. 1673 refuted. 0 times theorem prover too weak. 53642 trivial. 0 not checked. [2018-11-18 18:08:58,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:08:58,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12, 17] total 37 [2018-11-18 18:08:58,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:08:58,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 18:08:58,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 18:08:58,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 18:08:58,581 INFO L87 Difference]: Start difference. First operand 326 states and 396 transitions. Second operand 30 states. [2018-11-18 18:08:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:08:59,433 INFO L93 Difference]: Finished difference Result 620 states and 771 transitions. [2018-11-18 18:08:59,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-18 18:08:59,433 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1389 [2018-11-18 18:08:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:08:59,435 INFO L225 Difference]: With dead ends: 620 [2018-11-18 18:08:59,436 INFO L226 Difference]: Without dead ends: 338 [2018-11-18 18:08:59,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2853 GetRequests, 2760 SyntacticMatches, 15 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=829, Invalid=5491, Unknown=0, NotChecked=0, Total=6320 [2018-11-18 18:08:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-18 18:08:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 316. [2018-11-18 18:08:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-11-18 18:08:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 374 transitions. [2018-11-18 18:08:59,452 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 374 transitions. Word has length 1389 [2018-11-18 18:08:59,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:08:59,452 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 374 transitions. [2018-11-18 18:08:59,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 18:08:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 374 transitions. [2018-11-18 18:08:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-11-18 18:08:59,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:08:59,459 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:08:59,459 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:08:59,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:08:59,459 INFO L82 PathProgramCache]: Analyzing trace with hash 416823031, now seen corresponding path program 15 times [2018-11-18 18:08:59,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:08:59,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:59,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 18:08:59,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:08:59,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:08:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:08:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:08:59,595 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 18:08:59,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:08:59 BoogieIcfgContainer [2018-11-18 18:08:59,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 18:08:59,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 18:08:59,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 18:08:59,673 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 18:08:59,674 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:03:37" (3/4) ... [2018-11-18 18:08:59,676 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 18:08:59,786 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5d746f2d-c2eb-4175-ae42-d3159e3aadf9/bin-2019/utaipan/witness.graphml [2018-11-18 18:08:59,787 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 18:08:59,787 INFO L168 Benchmark]: Toolchain (without parser) took 323073.74 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 958.5 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-11-18 18:08:59,789 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:08:59,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.16 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:08:59,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.24 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:08:59,791 INFO L168 Benchmark]: Boogie Preprocessor took 10.06 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:08:59,791 INFO L168 Benchmark]: RCFGBuilder took 173.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-18 18:08:59,791 INFO L168 Benchmark]: TraceAbstraction took 322604.95 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-11-18 18:08:59,791 INFO L168 Benchmark]: Witness Printer took 113.65 ms. Allocated memory is still 7.2 GB. Free memory was 4.5 GB in the beginning and 4.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2018-11-18 18:08:59,793 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.16 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 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.24 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.06 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 173.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 322604.95 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 113.65 ms. Allocated memory is still 7.2 GB. Free memory was 4.5 GB in the beginning and 4.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. 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 = 10; VAL [x=10] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(n-2) 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] RET return fibo2(n-1) + fibo2(n-2); [L37] EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L37] int result = fibo1(x); [L38] COND TRUE result == 55 VAL [result=55, x=10] [L39] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 322.5s OverallTime, 26 OverallIterations, 200 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1024 SDtfs, 2069 SDslu, 8923 SDs, 0 SdLazy, 12381 SolverSat, 2215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 33736 GetRequests, 32579 SyntacticMatches, 250 SemanticMatches, 907 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11447 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 256.3s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.8752252252252253 AbsIntWeakeningRatio, 0.5783783783783784 AbsIntAvgWeakeningVarsNumRemoved, 0.1945945945945946 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 722 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 45.1s InterpolantComputationTime, 34272 NumberOfCodeBlocks, 29091 NumberOfCodeBlocksAsserted, 177 NumberOfCheckSat, 49328 ConstructedInterpolants, 0 QuantifiedInterpolants, 78931436 SizeOfPredicates, 140 NumberOfNonLiveVariables, 24162 ConjunctsInSsa, 271 ConjunctsInUnsatCore, 61 InterpolantComputations, 2 PerfectInterpolantSequences, 2056498/2141970 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...