./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/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 e21c3699338992ddad7e6d15f4351c8cc3315b0b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:02:00,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:02:00,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:02:00,262 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:02:00,263 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:02:00,263 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:02:00,264 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:02:00,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:02:00,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:02:00,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:02:00,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:02:00,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:02:00,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:02:00,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:02:00,268 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:02:00,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:02:00,268 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:02:00,269 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:02:00,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:02:00,271 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:02:00,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:02:00,272 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:02:00,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:02:00,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:02:00,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:02:00,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:02:00,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:02:00,274 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:02:00,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:02:00,275 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:02:00,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:02:00,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:02:00,276 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:02:00,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:02:00,276 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:02:00,277 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:02:00,277 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 05:02:00,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:02:00,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:02:00,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:02:00,285 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:02:00,285 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 05:02:00,285 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 05:02:00,285 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 05:02:00,285 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 05:02:00,285 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 05:02:00,285 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 05:02:00,285 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 05:02:00,285 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 05:02:00,285 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 05:02:00,286 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:02:00,286 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:02:00,286 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:02:00,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:02:00,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:02:00,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:02:00,286 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:02:00,286 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:02:00,286 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:02:00,287 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:02:00,287 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:02:00,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:02:00,287 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:02:00,287 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:02:00,287 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:02:00,287 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:02:00,287 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:02:00,287 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:02:00,287 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:02:00,288 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 05:02:00,288 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:02:00,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:02:00,288 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 05:02:00,288 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_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2018-12-02 05:02:00,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:02:00,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:02:00,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:02:00,315 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:02:00,316 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:02:00,316 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-02 05:02:00,357 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/data/25522e7b0/f0900fd0da9c44b094c83390e5391967/FLAG7ff3bb556 [2018-12-02 05:02:00,760 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:02:00,761 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-02 05:02:00,764 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/data/25522e7b0/f0900fd0da9c44b094c83390e5391967/FLAG7ff3bb556 [2018-12-02 05:02:00,773 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/data/25522e7b0/f0900fd0da9c44b094c83390e5391967 [2018-12-02 05:02:00,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:02:00,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:02:00,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:02:00,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:02:00,778 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:02:00,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:02:00" (1/1) ... [2018-12-02 05:02:00,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d01f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00, skipping insertion in model container [2018-12-02 05:02:00,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:02:00" (1/1) ... [2018-12-02 05:02:00,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:02:00,794 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:02:00,889 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:02:00,892 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:02:00,901 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:02:00,909 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:02:00,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00 WrapperNode [2018-12-02 05:02:00,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:02:00,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:02:00,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:02:00,910 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:02:00,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00" (1/1) ... [2018-12-02 05:02:00,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00" (1/1) ... [2018-12-02 05:02:00,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:02:00,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:02:00,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:02:00,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:02:00,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00" (1/1) ... [2018-12-02 05:02:00,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00" (1/1) ... [2018-12-02 05:02:00,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00" (1/1) ... [2018-12-02 05:02:00,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00" (1/1) ... [2018-12-02 05:02:00,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00" (1/1) ... [2018-12-02 05:02:00,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00" (1/1) ... [2018-12-02 05:02:00,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00" (1/1) ... [2018-12-02 05:02:00,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:02:00,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:02:00,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:02:00,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:02:00,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:02:00,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:02:00,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:02:00,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:02:00,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:02:00,995 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:02:00,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:02:00,995 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-02 05:02:00,995 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-02 05:02:00,995 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-02 05:02:00,995 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-02 05:02:01,089 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:02:01,089 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 05:02:01,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:02:01 BoogieIcfgContainer [2018-12-02 05:02:01,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:02:01,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:02:01,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:02:01,092 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:02:01,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:02:00" (1/3) ... [2018-12-02 05:02:01,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad97423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:02:01, skipping insertion in model container [2018-12-02 05:02:01,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:00" (2/3) ... [2018-12-02 05:02:01,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad97423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:02:01, skipping insertion in model container [2018-12-02 05:02:01,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:02:01" (3/3) ... [2018-12-02 05:02:01,094 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-02 05:02:01,099 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:02:01,103 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 05:02:01,112 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 05:02:01,130 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:02:01,130 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:02:01,130 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:02:01,130 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:02:01,130 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:02:01,131 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:02:01,131 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:02:01,131 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:02:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-02 05:02:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 05:02:01,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:01,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:01,146 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:01,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-02 05:02:01,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:01,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:01,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:02:01,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:01,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:02:01,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:02:01,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:02:01,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:02:01,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:02:01,252 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-02 05:02:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:01,311 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-02 05:02:01,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:02:01,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 05:02:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:01,320 INFO L225 Difference]: With dead ends: 44 [2018-12-02 05:02:01,321 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 05:02:01,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:02:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 05:02:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-02 05:02:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 05:02:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-02 05:02:01,348 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-02 05:02:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:01,349 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-02 05:02:01,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:02:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-02 05:02:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 05:02:01,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:01,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:01,350 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:01,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:01,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-02 05:02:01,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:01,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:01,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:02:01,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:01,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:02:01,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:02:01,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:02:01,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:02:01,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:02:01,383 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-02 05:02:01,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:01,422 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-02 05:02:01,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:02:01,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 05:02:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:01,424 INFO L225 Difference]: With dead ends: 36 [2018-12-02 05:02:01,424 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 05:02:01,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:02:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 05:02:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-02 05:02:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 05:02:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-02 05:02:01,428 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-02 05:02:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:01,428 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-02 05:02:01,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:02:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-02 05:02:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 05:02:01,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:01,429 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:01,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:01,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:01,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-02 05:02:01,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:01,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:01,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:01,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:01,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:02:01,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:01,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:01,485 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-02 05:02:01,486 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-12-02 05:02:01,506 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:02:01,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:02:01,566 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 05:02:01,566 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-02 05:02:01,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:01,571 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 05:02:01,598 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-12-02 05:02:01,598 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 05:02:01,615 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-02 05:02:01,615 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 05:02:01,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:02:01,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-12-02 05:02:01,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:02:01,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:02:01,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:02:01,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:02:01,616 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-12-02 05:02:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:01,723 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-12-02 05:02:01,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:02:01,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-02 05:02:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:01,724 INFO L225 Difference]: With dead ends: 72 [2018-12-02 05:02:01,724 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 05:02:01,725 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:02:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 05:02:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-02 05:02:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 05:02:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-02 05:02:01,730 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-12-02 05:02:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:01,730 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-02 05:02:01,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:02:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-02 05:02:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 05:02:01,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:01,732 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:01,732 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:01,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-02 05:02:01,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:01,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:01,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:01,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:01,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 05:02:01,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:01,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:01,770 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-02 05:02:01,770 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-02 05:02:01,771 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:02:01,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:02:01,862 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 05:02:01,862 INFO L272 AbstractInterpreter]: Visited 28 different actions 313 times. Never merged. Widened at 2 different actions 18 times. Performed 647 root evaluator evaluations with a maximum evaluation depth of 4. Performed 647 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 29 fixpoints after 6 different actions. Largest state had 5 variables. [2018-12-02 05:02:01,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:01,865 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 05:02:01,875 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-12-02 05:02:01,876 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 05:02:01,902 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-02 05:02:01,902 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 05:02:01,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:02:01,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-02 05:02:01,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:02:01,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:02:01,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:02:01,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:02:01,903 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-12-02 05:02:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:02,076 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-02 05:02:02,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:02:02,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-12-02 05:02:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:02,077 INFO L225 Difference]: With dead ends: 87 [2018-12-02 05:02:02,077 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 05:02:02,077 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:02:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 05:02:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-02 05:02:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 05:02:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-12-02 05:02:02,083 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-12-02 05:02:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:02,083 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-12-02 05:02:02,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:02:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-12-02 05:02:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 05:02:02,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:02,085 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:02,085 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:02,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:02,085 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-12-02 05:02:02,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:02,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:02,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:02,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:02,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 05:02:02,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:02,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:02,134 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:02,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:02,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:02,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:02,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:02:02,142 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:02:02,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 05:02:02,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:02:02,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 05:02:02,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 05:02:02,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:02,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-12-02 05:02:02,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:02,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:02:02,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:02:02,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:02:02,464 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-12-02 05:02:02,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:02,608 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-12-02 05:02:02,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:02:02,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-12-02 05:02:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:02,609 INFO L225 Difference]: With dead ends: 121 [2018-12-02 05:02:02,609 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 05:02:02,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:02:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 05:02:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-12-02 05:02:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 05:02:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-12-02 05:02:02,616 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-12-02 05:02:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:02,616 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-12-02 05:02:02,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:02:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-12-02 05:02:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:02:02,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:02,618 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:02,618 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:02,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:02,618 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-12-02 05:02:02,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:02,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:02,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:02:02,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:02,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 05:02:02,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:02,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:02,655 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-02 05:02:02,655 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-02 05:02:02,656 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:02:02,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:02:03,362 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 05:02:03,362 INFO L272 AbstractInterpreter]: Visited 29 different actions 4700 times. Merged at 11 different actions 1218 times. Widened at 2 different actions 234 times. Performed 10886 root evaluator evaluations with a maximum evaluation depth of 4. Performed 10886 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 580 fixpoints after 9 different actions. Largest state had 5 variables. [2018-12-02 05:02:03,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:03,364 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 05:02:03,374 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-12-02 05:02:03,375 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 05:02:03,421 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-02 05:02:03,422 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 05:02:03,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:02:03,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-12-02 05:02:03,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:02:03,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:02:03,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:02:03,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:02:03,423 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2018-12-02 05:02:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:03,624 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-12-02 05:02:03,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:02:03,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-12-02 05:02:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:03,625 INFO L225 Difference]: With dead ends: 109 [2018-12-02 05:02:03,626 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 05:02:03,626 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:02:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 05:02:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 05:02:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 05:02:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-12-02 05:02:03,634 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 55 [2018-12-02 05:02:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:03,634 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-12-02 05:02:03,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:02:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-12-02 05:02:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:02:03,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:03,636 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:03,637 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:03,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:03,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1768644787, now seen corresponding path program 1 times [2018-12-02 05:02:03,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:03,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:03,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-02 05:02:03,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:03,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:03,684 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-12-02 05:02:03,684 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-02 05:02:03,685 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:02:03,685 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:02:09,548 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 05:02:09,548 INFO L272 AbstractInterpreter]: Visited 34 different actions 66808 times. Merged at 14 different actions 20936 times. Widened at 4 different actions 2001 times. Performed 164394 root evaluator evaluations with a maximum evaluation depth of 4. Performed 164394 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9083 fixpoints after 10 different actions. Largest state had 5 variables. [2018-12-02 05:02:09,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:09,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 05:02:09,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:09,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:09,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:09,557 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:02:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:09,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 05:02:09,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 48 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 05:02:10,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:10,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 13] total 18 [2018-12-02 05:02:10,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:10,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:02:10,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:02:10,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:02:10,060 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 12 states. [2018-12-02 05:02:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:10,215 INFO L93 Difference]: Finished difference Result 144 states and 218 transitions. [2018-12-02 05:02:10,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:02:10,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-02 05:02:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:10,217 INFO L225 Difference]: With dead ends: 144 [2018-12-02 05:02:10,217 INFO L226 Difference]: Without dead ends: 95 [2018-12-02 05:02:10,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 117 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-12-02 05:02:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-02 05:02:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2018-12-02 05:02:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 05:02:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-12-02 05:02:10,230 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 67 [2018-12-02 05:02:10,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:10,231 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-12-02 05:02:10,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:02:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-12-02 05:02:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 05:02:10,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:10,233 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:10,233 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:10,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash 650896746, now seen corresponding path program 1 times [2018-12-02 05:02:10,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:10,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:10,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:10,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:10,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-12-02 05:02:10,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:10,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:10,316 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-12-02 05:02:10,316 INFO L205 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-12-02 05:02:10,317 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:02:10,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:02:10,589 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 05:02:10,589 INFO L272 AbstractInterpreter]: Visited 29 different actions 3221 times. Merged at 11 different actions 850 times. Widened at 2 different actions 130 times. Performed 7908 root evaluator evaluations with a maximum evaluation depth of 4. Performed 7908 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 384 fixpoints after 9 different actions. Largest state had 5 variables. [2018-12-02 05:02:10,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:10,591 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 05:02:10,604 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 55.26% of their original sizes. [2018-12-02 05:02:10,604 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 05:02:10,665 INFO L418 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2018-12-02 05:02:10,665 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 05:02:10,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:02:10,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2018-12-02 05:02:10,666 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:02:10,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 05:02:10,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 05:02:10,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:02:10,667 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 15 states. [2018-12-02 05:02:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:10,971 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2018-12-02 05:02:10,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:02:10,972 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2018-12-02 05:02:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:10,973 INFO L225 Difference]: With dead ends: 136 [2018-12-02 05:02:10,973 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 05:02:10,973 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:02:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 05:02:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-02 05:02:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 05:02:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2018-12-02 05:02:10,979 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 81 [2018-12-02 05:02:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:10,979 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2018-12-02 05:02:10,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 05:02:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2018-12-02 05:02:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 05:02:10,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:10,981 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:10,981 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:10,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1708632044, now seen corresponding path program 2 times [2018-12-02 05:02:10,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:10,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:10,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 68 proven. 48 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-12-02 05:02:11,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:11,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:11,054 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:11,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:11,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:11,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:11,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:02:11,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:02:11,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 05:02:11,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:02:11,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 67 proven. 15 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-12-02 05:02:11,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 67 proven. 16 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-12-02 05:02:11,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:11,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 20 [2018-12-02 05:02:11,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:11,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 05:02:11,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 05:02:11,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-12-02 05:02:11,331 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 16 states. [2018-12-02 05:02:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:11,620 INFO L93 Difference]: Finished difference Result 218 states and 340 transitions. [2018-12-02 05:02:11,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 05:02:11,620 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-12-02 05:02:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:11,621 INFO L225 Difference]: With dead ends: 218 [2018-12-02 05:02:11,621 INFO L226 Difference]: Without dead ends: 147 [2018-12-02 05:02:11,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 202 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 05:02:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-02 05:02:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 117. [2018-12-02 05:02:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-02 05:02:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2018-12-02 05:02:11,631 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 108 [2018-12-02 05:02:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:11,631 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2018-12-02 05:02:11,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 05:02:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2018-12-02 05:02:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 05:02:11,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:11,633 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:11,633 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:11,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash 388544251, now seen corresponding path program 3 times [2018-12-02 05:02:11,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:11,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:11,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:02:11,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:11,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 112 proven. 43 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-12-02 05:02:11,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:11,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:11,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:11,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:11,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:11,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:11,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:02:11,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 05:02:11,746 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:02:11,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:02:11,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 43 proven. 195 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-12-02 05:02:11,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 43 proven. 211 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-12-02 05:02:12,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:12,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 15] total 24 [2018-12-02 05:02:12,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:12,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:02:12,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:02:12,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-12-02 05:02:12,489 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand 17 states. [2018-12-02 05:02:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:12,795 INFO L93 Difference]: Finished difference Result 319 states and 576 transitions. [2018-12-02 05:02:12,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 05:02:12,795 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 148 [2018-12-02 05:02:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:12,797 INFO L225 Difference]: With dead ends: 319 [2018-12-02 05:02:12,797 INFO L226 Difference]: Without dead ends: 194 [2018-12-02 05:02:12,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 270 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 05:02:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-02 05:02:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2018-12-02 05:02:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-02 05:02:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2018-12-02 05:02:12,812 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 148 [2018-12-02 05:02:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:12,812 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2018-12-02 05:02:12,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:02:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2018-12-02 05:02:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-12-02 05:02:12,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:12,815 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 15, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:12,816 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:12,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash -254279982, now seen corresponding path program 4 times [2018-12-02 05:02:12,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:12,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:12,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:02:12,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:12,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 214 proven. 206 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2018-12-02 05:02:12,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:12,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:12,917 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:12,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:12,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:12,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:12,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:12,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:02:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:13,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 107 proven. 510 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-12-02 05:02:13,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 107 proven. 534 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2018-12-02 05:02:14,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:14,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 17] total 23 [2018-12-02 05:02:14,104 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:14,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 05:02:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 05:02:14,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-12-02 05:02:14,104 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand 16 states. [2018-12-02 05:02:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:14,382 INFO L93 Difference]: Finished difference Result 356 states and 720 transitions. [2018-12-02 05:02:14,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:02:14,382 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 273 [2018-12-02 05:02:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:14,385 INFO L225 Difference]: With dead ends: 356 [2018-12-02 05:02:14,385 INFO L226 Difference]: Without dead ends: 210 [2018-12-02 05:02:14,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 516 SyntacticMatches, 15 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=964, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 05:02:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-02 05:02:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 149. [2018-12-02 05:02:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-02 05:02:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 223 transitions. [2018-12-02 05:02:14,400 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 223 transitions. Word has length 273 [2018-12-02 05:02:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:14,401 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 223 transitions. [2018-12-02 05:02:14,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 05:02:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 223 transitions. [2018-12-02 05:02:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-12-02 05:02:14,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:14,404 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 20, 17, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 8, 8, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:14,405 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:14,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:14,405 INFO L82 PathProgramCache]: Analyzing trace with hash 219391680, now seen corresponding path program 5 times [2018-12-02 05:02:14,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:14,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:14,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3402 backedges. 286 proven. 415 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-02 05:02:14,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:14,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:14,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:14,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:14,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:14,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:14,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:02:14,534 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:02:14,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-02 05:02:14,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:02:14,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3402 backedges. 518 proven. 84 refuted. 0 times theorem prover too weak. 2800 trivial. 0 not checked. [2018-12-02 05:02:14,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3402 backedges. 522 proven. 90 refuted. 0 times theorem prover too weak. 2790 trivial. 0 not checked. [2018-12-02 05:02:15,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:15,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2018-12-02 05:02:15,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:15,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 05:02:15,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 05:02:15,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-12-02 05:02:15,355 INFO L87 Difference]: Start difference. First operand 149 states and 223 transitions. Second operand 18 states. [2018-12-02 05:02:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:15,792 INFO L93 Difference]: Finished difference Result 333 states and 567 transitions. [2018-12-02 05:02:15,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 05:02:15,793 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 350 [2018-12-02 05:02:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:15,794 INFO L225 Difference]: With dead ends: 333 [2018-12-02 05:02:15,794 INFO L226 Difference]: Without dead ends: 209 [2018-12-02 05:02:15,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 678 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 05:02:15,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-02 05:02:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 181. [2018-12-02 05:02:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-02 05:02:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 266 transitions. [2018-12-02 05:02:15,805 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 266 transitions. Word has length 350 [2018-12-02 05:02:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:15,806 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 266 transitions. [2018-12-02 05:02:15,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 05:02:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 266 transitions. [2018-12-02 05:02:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-12-02 05:02:15,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:15,807 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 26, 26, 21, 19, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 10, 7, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:15,807 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:15,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:15,808 INFO L82 PathProgramCache]: Analyzing trace with hash -321291044, now seen corresponding path program 6 times [2018-12-02 05:02:15,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:15,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:15,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:02:15,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:15,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3981 backedges. 191 proven. 506 refuted. 0 times theorem prover too weak. 3284 trivial. 0 not checked. [2018-12-02 05:02:15,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:15,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:15,917 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:15,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:15,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:15,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:15,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:02:15,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 05:02:15,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:02:15,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:02:15,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3981 backedges. 172 proven. 725 refuted. 0 times theorem prover too weak. 3084 trivial. 0 not checked. [2018-12-02 05:02:16,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3981 backedges. 172 proven. 746 refuted. 0 times theorem prover too weak. 3063 trivial. 0 not checked. [2018-12-02 05:02:17,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:17,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 17] total 24 [2018-12-02 05:02:17,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:17,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:02:17,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:02:17,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-12-02 05:02:17,186 INFO L87 Difference]: Start difference. First operand 181 states and 266 transitions. Second operand 17 states. [2018-12-02 05:02:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:17,508 INFO L93 Difference]: Finished difference Result 396 states and 709 transitions. [2018-12-02 05:02:17,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 05:02:17,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 377 [2018-12-02 05:02:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:17,510 INFO L225 Difference]: With dead ends: 396 [2018-12-02 05:02:17,510 INFO L226 Difference]: Without dead ends: 241 [2018-12-02 05:02:17,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 776 GetRequests, 725 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 05:02:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-02 05:02:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 172. [2018-12-02 05:02:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 05:02:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 242 transitions. [2018-12-02 05:02:17,524 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 242 transitions. Word has length 377 [2018-12-02 05:02:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:17,524 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 242 transitions. [2018-12-02 05:02:17,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:02:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 242 transitions. [2018-12-02 05:02:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-12-02 05:02:17,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:17,527 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 22, 19, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 10, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:17,527 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:17,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2066779636, now seen corresponding path program 7 times [2018-12-02 05:02:17,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:17,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:02:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:17,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 436 proven. 185 refuted. 0 times theorem prover too weak. 2865 trivial. 0 not checked. [2018-12-02 05:02:17,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:17,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:17,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:17,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:17,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:17,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:17,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:17,679 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:02:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:17,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 246 proven. 484 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-12-02 05:02:17,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 248 proven. 498 refuted. 0 times theorem prover too weak. 2740 trivial. 0 not checked. [2018-12-02 05:02:18,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:18,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 20 [2018-12-02 05:02:18,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:18,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 05:02:18,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 05:02:18,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-12-02 05:02:18,544 INFO L87 Difference]: Start difference. First operand 172 states and 242 transitions. Second operand 14 states. [2018-12-02 05:02:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:18,684 INFO L93 Difference]: Finished difference Result 271 states and 471 transitions. [2018-12-02 05:02:18,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:02:18,684 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 354 [2018-12-02 05:02:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:18,686 INFO L225 Difference]: With dead ends: 271 [2018-12-02 05:02:18,686 INFO L226 Difference]: Without dead ends: 254 [2018-12-02 05:02:18,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 689 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-12-02 05:02:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-02 05:02:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 185. [2018-12-02 05:02:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-02 05:02:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 281 transitions. [2018-12-02 05:02:18,697 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 281 transitions. Word has length 354 [2018-12-02 05:02:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:18,697 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 281 transitions. [2018-12-02 05:02:18,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 05:02:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 281 transitions. [2018-12-02 05:02:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-12-02 05:02:18,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:18,699 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 29, 28, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 11, 11, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:18,699 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:18,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:18,699 INFO L82 PathProgramCache]: Analyzing trace with hash -102941920, now seen corresponding path program 8 times [2018-12-02 05:02:18,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:18,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:18,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:18,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:18,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 511 proven. 771 refuted. 0 times theorem prover too weak. 5558 trivial. 0 not checked. [2018-12-02 05:02:18,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:18,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:18,909 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:18,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:18,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:18,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:18,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:02:18,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:02:19,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-02 05:02:19,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:02:19,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 3692 proven. 34 refuted. 0 times theorem prover too weak. 3114 trivial. 0 not checked. [2018-12-02 05:02:19,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 519 proven. 707 refuted. 0 times theorem prover too weak. 5614 trivial. 0 not checked. [2018-12-02 05:02:20,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:20,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 22 [2018-12-02 05:02:20,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:20,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:02:20,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:02:20,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:02:20,030 INFO L87 Difference]: Start difference. First operand 185 states and 281 transitions. Second operand 17 states. [2018-12-02 05:02:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:20,294 INFO L93 Difference]: Finished difference Result 373 states and 651 transitions. [2018-12-02 05:02:20,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:02:20,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 490 [2018-12-02 05:02:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:20,296 INFO L225 Difference]: With dead ends: 373 [2018-12-02 05:02:20,296 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 05:02:20,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1006 GetRequests, 963 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=917, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 05:02:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 05:02:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 202. [2018-12-02 05:02:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-02 05:02:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2018-12-02 05:02:20,314 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 304 transitions. Word has length 490 [2018-12-02 05:02:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:20,314 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 304 transitions. [2018-12-02 05:02:20,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:02:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 304 transitions. [2018-12-02 05:02:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-12-02 05:02:20,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:20,318 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 33, 32, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 12, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:20,318 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:20,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:20,318 INFO L82 PathProgramCache]: Analyzing trace with hash -874340465, now seen corresponding path program 9 times [2018-12-02 05:02:20,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:20,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:20,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:02:20,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:20,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8944 backedges. 852 proven. 714 refuted. 0 times theorem prover too weak. 7378 trivial. 0 not checked. [2018-12-02 05:02:20,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:20,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:20,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:20,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:20,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:20,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:20,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:02:20,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 05:02:20,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:02:20,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:02:20,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8944 backedges. 658 proven. 833 refuted. 0 times theorem prover too weak. 7453 trivial. 0 not checked. [2018-12-02 05:02:20,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8944 backedges. 655 proven. 857 refuted. 0 times theorem prover too weak. 7432 trivial. 0 not checked. [2018-12-02 05:02:22,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:22,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 18] total 30 [2018-12-02 05:02:22,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:22,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 05:02:22,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 05:02:22,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-12-02 05:02:22,352 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand 22 states. [2018-12-02 05:02:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:22,942 INFO L93 Difference]: Finished difference Result 556 states and 1173 transitions. [2018-12-02 05:02:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-02 05:02:22,942 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 558 [2018-12-02 05:02:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:22,945 INFO L225 Difference]: With dead ends: 556 [2018-12-02 05:02:22,945 INFO L226 Difference]: Without dead ends: 275 [2018-12-02 05:02:22,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1148 GetRequests, 1087 SyntacticMatches, 15 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=372, Invalid=1884, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 05:02:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-02 05:02:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2018-12-02 05:02:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-02 05:02:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 418 transitions. [2018-12-02 05:02:22,962 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 418 transitions. Word has length 558 [2018-12-02 05:02:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:22,962 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 418 transitions. [2018-12-02 05:02:22,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 05:02:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 418 transitions. [2018-12-02 05:02:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-12-02 05:02:22,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:22,965 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 32, 31, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 13, 11, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:22,966 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:22,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:22,966 INFO L82 PathProgramCache]: Analyzing trace with hash 975334482, now seen corresponding path program 10 times [2018-12-02 05:02:22,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:22,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:22,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:02:22,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:22,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8489 backedges. 415 proven. 730 refuted. 0 times theorem prover too weak. 7344 trivial. 0 not checked. [2018-12-02 05:02:23,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:23,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:23,119 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:23,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:23,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:23,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:23,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:23,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:02:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:23,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8489 backedges. 382 proven. 874 refuted. 0 times theorem prover too weak. 7233 trivial. 0 not checked. [2018-12-02 05:02:23,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8489 backedges. 384 proven. 888 refuted. 0 times theorem prover too weak. 7217 trivial. 0 not checked. [2018-12-02 05:02:24,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:24,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 16] total 27 [2018-12-02 05:02:24,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:24,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 05:02:24,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 05:02:24,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-12-02 05:02:24,499 INFO L87 Difference]: Start difference. First operand 254 states and 418 transitions. Second operand 20 states. [2018-12-02 05:02:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:24,877 INFO L93 Difference]: Finished difference Result 595 states and 1162 transitions. [2018-12-02 05:02:24,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 05:02:24,877 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 544 [2018-12-02 05:02:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:24,879 INFO L225 Difference]: With dead ends: 595 [2018-12-02 05:02:24,879 INFO L226 Difference]: Without dead ends: 240 [2018-12-02 05:02:24,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 1059 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1358, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 05:02:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-12-02 05:02:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 233. [2018-12-02 05:02:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-02 05:02:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 345 transitions. [2018-12-02 05:02:24,893 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 345 transitions. Word has length 544 [2018-12-02 05:02:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:24,894 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 345 transitions. [2018-12-02 05:02:24,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 05:02:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 345 transitions. [2018-12-02 05:02:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-12-02 05:02:24,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:24,896 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 30, 29, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 12, 11, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:24,897 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:24,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1340213665, now seen corresponding path program 11 times [2018-12-02 05:02:24,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:24,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:24,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 817 proven. 341 refuted. 0 times theorem prover too weak. 6091 trivial. 0 not checked. [2018-12-02 05:02:25,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:25,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:25,068 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:25,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:25,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:25,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:25,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:02:25,076 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:02:25,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-02 05:02:25,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:02:25,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 3408 proven. 31 refuted. 0 times theorem prover too weak. 3810 trivial. 0 not checked. [2018-12-02 05:02:25,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 827 proven. 253 refuted. 0 times theorem prover too weak. 6169 trivial. 0 not checked. [2018-12-02 05:02:26,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:26,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 24 [2018-12-02 05:02:26,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:26,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 05:02:26,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 05:02:26,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-12-02 05:02:26,054 INFO L87 Difference]: Start difference. First operand 233 states and 345 transitions. Second operand 20 states. [2018-12-02 05:02:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:26,407 INFO L93 Difference]: Finished difference Result 463 states and 711 transitions. [2018-12-02 05:02:26,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 05:02:26,407 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 504 [2018-12-02 05:02:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:26,409 INFO L225 Difference]: With dead ends: 463 [2018-12-02 05:02:26,409 INFO L226 Difference]: Without dead ends: 243 [2018-12-02 05:02:26,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1039 GetRequests, 993 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 05:02:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-02 05:02:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2018-12-02 05:02:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 05:02:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2018-12-02 05:02:26,421 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 504 [2018-12-02 05:02:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:26,421 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2018-12-02 05:02:26,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 05:02:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2018-12-02 05:02:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-12-02 05:02:26,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:26,424 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 39, 39, 34, 33, 22, 22, 22, 22, 22, 22, 22, 19, 19, 19, 19, 19, 19, 19, 15, 11, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:26,424 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:26,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:26,424 INFO L82 PathProgramCache]: Analyzing trace with hash -749380216, now seen corresponding path program 12 times [2018-12-02 05:02:26,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:26,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:26,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:02:26,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:26,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9445 backedges. 428 proven. 1520 refuted. 0 times theorem prover too weak. 7497 trivial. 0 not checked. [2018-12-02 05:02:26,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:26,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:26,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:26,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:26,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:26,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:26,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:02:26,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 05:02:26,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:02:26,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:02:26,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9445 backedges. 399 proven. 1130 refuted. 0 times theorem prover too weak. 7916 trivial. 0 not checked. [2018-12-02 05:02:26,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9445 backedges. 398 proven. 1152 refuted. 0 times theorem prover too weak. 7895 trivial. 0 not checked. [2018-12-02 05:02:28,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:28,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 18] total 28 [2018-12-02 05:02:28,654 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:28,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 05:02:28,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 05:02:28,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-12-02 05:02:28,655 INFO L87 Difference]: Start difference. First operand 232 states and 316 transitions. Second operand 20 states. [2018-12-02 05:02:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:29,186 INFO L93 Difference]: Finished difference Result 549 states and 805 transitions. [2018-12-02 05:02:29,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 05:02:29,186 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 572 [2018-12-02 05:02:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:29,187 INFO L225 Difference]: With dead ends: 549 [2018-12-02 05:02:29,187 INFO L226 Difference]: Without dead ends: 212 [2018-12-02 05:02:29,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1181 GetRequests, 1118 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1978, Unknown=0, NotChecked=0, Total=2352 [2018-12-02 05:02:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-02 05:02:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 193. [2018-12-02 05:02:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-02 05:02:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 229 transitions. [2018-12-02 05:02:29,199 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 229 transitions. Word has length 572 [2018-12-02 05:02:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:29,199 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 229 transitions. [2018-12-02 05:02:29,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 05:02:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 229 transitions. [2018-12-02 05:02:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-12-02 05:02:29,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:29,201 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 33, 33, 30, 28, 20, 20, 20, 20, 20, 20, 20, 16, 16, 16, 16, 16, 16, 16, 14, 10, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:29,201 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:29,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:29,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1000587999, now seen corresponding path program 13 times [2018-12-02 05:02:29,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:29,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:29,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:02:29,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:29,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7285 backedges. 759 proven. 159 refuted. 0 times theorem prover too weak. 6367 trivial. 0 not checked. [2018-12-02 05:02:29,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:29,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:29,389 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:29,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:29,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:29,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:29,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:29,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:02:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:29,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7285 backedges. 708 proven. 259 refuted. 0 times theorem prover too weak. 6318 trivial. 0 not checked. [2018-12-02 05:02:29,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7285 backedges. 708 proven. 269 refuted. 0 times theorem prover too weak. 6308 trivial. 0 not checked. [2018-12-02 05:02:30,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:30,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 25 [2018-12-02 05:02:30,448 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:30,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 05:02:30,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 05:02:30,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2018-12-02 05:02:30,449 INFO L87 Difference]: Start difference. First operand 193 states and 229 transitions. Second operand 19 states. [2018-12-02 05:02:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:30,775 INFO L93 Difference]: Finished difference Result 381 states and 458 transitions. [2018-12-02 05:02:30,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:02:30,775 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 503 [2018-12-02 05:02:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:30,777 INFO L225 Difference]: With dead ends: 381 [2018-12-02 05:02:30,777 INFO L226 Difference]: Without dead ends: 210 [2018-12-02 05:02:30,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 981 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 05:02:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-02 05:02:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 182. [2018-12-02 05:02:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-02 05:02:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 211 transitions. [2018-12-02 05:02:30,788 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 211 transitions. Word has length 503 [2018-12-02 05:02:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:30,788 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 211 transitions. [2018-12-02 05:02:30,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 05:02:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2018-12-02 05:02:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-12-02 05:02:30,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:30,790 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 35, 35, 30, 29, 19, 19, 19, 19, 19, 19, 19, 17, 17, 17, 17, 17, 17, 17, 13, 10, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:30,790 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:30,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1638954211, now seen corresponding path program 14 times [2018-12-02 05:02:30,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:30,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:30,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:30,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:30,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 1313 proven. 334 refuted. 0 times theorem prover too weak. 5614 trivial. 0 not checked. [2018-12-02 05:02:30,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:30,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:02:30,989 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:02:30,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:02:30,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:30,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:02:30,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:02:30,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:02:31,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-02 05:02:31,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:02:31,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 1201 proven. 210 refuted. 0 times theorem prover too weak. 5850 trivial. 0 not checked. [2018-12-02 05:02:31,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:02:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 1203 proven. 214 refuted. 0 times theorem prover too weak. 5844 trivial. 0 not checked. [2018-12-02 05:02:32,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:02:32,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 17] total 29 [2018-12-02 05:02:32,165 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:02:32,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 05:02:32,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 05:02:32,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-12-02 05:02:32,166 INFO L87 Difference]: Start difference. First operand 182 states and 211 transitions. Second operand 22 states. [2018-12-02 05:02:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:32,736 INFO L93 Difference]: Finished difference Result 364 states and 436 transitions. [2018-12-02 05:02:32,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 05:02:32,737 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 504 [2018-12-02 05:02:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:32,738 INFO L225 Difference]: With dead ends: 364 [2018-12-02 05:02:32,738 INFO L226 Difference]: Without dead ends: 215 [2018-12-02 05:02:32,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 986 SyntacticMatches, 15 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=536, Invalid=2886, Unknown=0, NotChecked=0, Total=3422 [2018-12-02 05:02:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-02 05:02:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 184. [2018-12-02 05:02:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-02 05:02:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2018-12-02 05:02:32,746 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 504 [2018-12-02 05:02:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:32,747 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2018-12-02 05:02:32,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 05:02:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2018-12-02 05:02:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-12-02 05:02:32,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:32,748 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:32,748 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:02:32,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:32,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 15 times [2018-12-02 05:02:32,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:02:32,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:02:32,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:02:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:02:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:02:32,796 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:02:32,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:02:32 BoogieIcfgContainer [2018-12-02 05:02:32,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:02:32,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:02:32,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:02:32,834 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:02:32,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:02:01" (3/4) ... [2018-12-02 05:02:32,836 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 05:02:32,888 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_20bd6b84-fcaf-428c-ad6e-f030de1fbaee/bin-2019/utaipan/witness.graphml [2018-12-02 05:02:32,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:02:32,889 INFO L168 Benchmark]: Toolchain (without parser) took 32113.67 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.5 GB). Free memory was 948.6 MB in the beginning and 1.0 GB in the end (delta: -79.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-02 05:02:32,890 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:02:32,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.34 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 937.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-12-02 05:02:32,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.20 ms. Allocated memory is still 1.0 GB. Free memory is still 937.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:02:32,890 INFO L168 Benchmark]: Boogie Preprocessor took 11.47 ms. Allocated memory is still 1.0 GB. Free memory is still 937.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:02:32,890 INFO L168 Benchmark]: RCFGBuilder took 156.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-12-02 05:02:32,890 INFO L168 Benchmark]: TraceAbstraction took 31744.18 ms. Allocated memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-02 05:02:32,891 INFO L168 Benchmark]: Witness Printer took 54.25 ms. Allocated memory is still 3.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:02:32,891 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.34 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 937.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.20 ms. Allocated memory is still 1.0 GB. Free memory is still 937.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.47 ms. Allocated memory is still 1.0 GB. Free memory is still 937.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 156.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31744.18 ms. Allocated memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 54.25 ms. Allocated memory is still 3.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 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 = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) 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] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, 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] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-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] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, 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] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-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] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, 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] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 31.7s OverallTime, 22 OverallIterations, 44 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 784 SDtfs, 1260 SDslu, 6071 SDs, 0 SdLazy, 7672 SolverSat, 1305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 11426 GetRequests, 10647 SyntacticMatches, 182 SemanticMatches, 597 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4543 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.0s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.8604060913705583 AbsIntWeakeningRatio, 0.5685279187817259 AbsIntAvgWeakeningVarsNumRemoved, 0.20812182741116753 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 491 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 11499 NumberOfCodeBlocks, 10323 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 16389 ConstructedInterpolants, 0 QuantifiedInterpolants, 9162718 SizeOfPredicates, 101 NumberOfNonLiveVariables, 9224 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 51 InterpolantComputations, 2 PerfectInterpolantSequences, 190174/208151 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...