./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/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_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/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-1dbac8b [2018-10-26 21:33:58,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:33:58,785 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:33:58,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:33:58,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:33:58,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:33:58,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:33:58,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:33:58,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:33:58,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:33:58,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:33:58,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:33:58,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:33:58,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:33:58,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:33:58,811 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:33:58,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:33:58,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:33:58,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:33:58,827 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:33:58,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:33:58,828 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:33:58,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:33:58,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:33:58,830 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:33:58,831 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:33:58,835 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:33:58,836 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:33:58,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:33:58,837 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:33:58,838 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:33:58,838 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:33:58,838 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:33:58,838 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:33:58,839 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:33:58,840 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:33:58,840 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 21:33:58,854 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:33:58,854 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:33:58,855 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:33:58,855 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:33:58,855 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:33:58,855 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:33:58,856 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 21:33:58,856 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:33:58,856 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 21:33:58,857 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 21:33:58,857 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:33:58,857 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:33:58,858 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:33:58,858 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:33:58,858 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:33:58,858 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:33:58,858 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:33:58,858 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:33:58,858 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:33:58,858 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:33:58,859 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:33:58,859 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:33:58,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:33:58,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:33:58,859 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:33:58,859 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:33:58,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:33:58,860 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:33:58,860 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:33:58,863 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:33:58,863 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 21:33:58,863 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:33:58,863 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:33:58,863 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:33:58,863 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_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/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-10-26 21:33:58,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:33:58,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:33:58,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:33:58,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:33:58,914 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:33:58,914 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-10-26 21:33:58,972 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/data/9ceba3940/bf1673754089429ba98cd9fb7bd9dac0/FLAGb8955961c [2018-10-26 21:33:59,359 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:33:59,360 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-10-26 21:33:59,365 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/data/9ceba3940/bf1673754089429ba98cd9fb7bd9dac0/FLAGb8955961c [2018-10-26 21:33:59,375 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/data/9ceba3940/bf1673754089429ba98cd9fb7bd9dac0 [2018-10-26 21:33:59,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:33:59,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:33:59,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:33:59,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:33:59,382 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:33:59,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:33:59" (1/1) ... [2018-10-26 21:33:59,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b90395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59, skipping insertion in model container [2018-10-26 21:33:59,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:33:59" (1/1) ... [2018-10-26 21:33:59,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:33:59,404 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:33:59,516 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:33:59,519 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:33:59,532 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:33:59,543 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:33:59,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59 WrapperNode [2018-10-26 21:33:59,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:33:59,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:33:59,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:33:59,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:33:59,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59" (1/1) ... [2018-10-26 21:33:59,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59" (1/1) ... [2018-10-26 21:33:59,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:33:59,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:33:59,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:33:59,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:33:59,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59" (1/1) ... [2018-10-26 21:33:59,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59" (1/1) ... [2018-10-26 21:33:59,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59" (1/1) ... [2018-10-26 21:33:59,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59" (1/1) ... [2018-10-26 21:33:59,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59" (1/1) ... [2018-10-26 21:33:59,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59" (1/1) ... [2018-10-26 21:33:59,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59" (1/1) ... [2018-10-26 21:33:59,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:33:59,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:33:59,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:33:59,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:33:59,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:33:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:33:59,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:33:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:33:59,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:33:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:33:59,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:33:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-10-26 21:33:59,705 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-10-26 21:33:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-10-26 21:33:59,705 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-10-26 21:34:00,032 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:34:00,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:34:00 BoogieIcfgContainer [2018-10-26 21:34:00,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:34:00,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:34:00,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:34:00,037 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:34:00,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:33:59" (1/3) ... [2018-10-26 21:34:00,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4f8a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:34:00, skipping insertion in model container [2018-10-26 21:34:00,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:59" (2/3) ... [2018-10-26 21:34:00,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4f8a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:34:00, skipping insertion in model container [2018-10-26 21:34:00,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:34:00" (3/3) ... [2018-10-26 21:34:00,041 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-10-26 21:34:00,050 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:34:00,057 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:34:00,071 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:34:00,097 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:34:00,097 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:34:00,097 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:34:00,097 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:34:00,097 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:34:00,098 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:34:00,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:34:00,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:34:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-10-26 21:34:00,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 21:34:00,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:00,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:00,129 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:00,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:00,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-10-26 21:34:00,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:00,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:00,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:34:00,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:34:00,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:34:00,400 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:34:00,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:34:00,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:34:00,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:34:00,413 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-10-26 21:34:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:00,544 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-10-26 21:34:00,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:34:00,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-26 21:34:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:00,556 INFO L225 Difference]: With dead ends: 44 [2018-10-26 21:34:00,556 INFO L226 Difference]: Without dead ends: 30 [2018-10-26 21:34:00,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:34:00,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-26 21:34:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-26 21:34:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-26 21:34:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-10-26 21:34:00,590 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-10-26 21:34:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:00,591 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-10-26 21:34:00,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:34:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-10-26 21:34:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 21:34:00,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:00,593 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:00,593 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:00,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:00,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-10-26 21:34:00,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:00,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:00,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:34:00,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:34:00,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:34:00,654 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:34:00,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:34:00,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:34:00,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:34:00,656 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-10-26 21:34:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:00,894 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-10-26 21:34:00,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:34:00,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-26 21:34:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:00,895 INFO L225 Difference]: With dead ends: 36 [2018-10-26 21:34:00,896 INFO L226 Difference]: Without dead ends: 32 [2018-10-26 21:34:00,896 INFO L605 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-10-26 21:34:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-26 21:34:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-10-26 21:34:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-26 21:34:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-10-26 21:34:00,902 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-10-26 21:34:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:00,902 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-10-26 21:34:00,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:34:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-10-26 21:34:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 21:34:00,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:00,903 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:00,904 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:00,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-10-26 21:34:00,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:00,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:00,906 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 21:34:01,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:01,007 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:01,008 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-26 21:34:01,009 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-10-26 21:34:01,047 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:34:01,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:34:01,138 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 21:34:01,139 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Never found a fixpoint. Largest state had 5 variables. [2018-10-26 21:34:01,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:01,152 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 21:34:01,201 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-10-26 21:34:01,201 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 21:34:01,348 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-10-26 21:34:01,348 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 21:34:01,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:34:01,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-10-26 21:34:01,349 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:34:01,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:34:01,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:34:01,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:34:01,350 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-10-26 21:34:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:01,685 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-10-26 21:34:01,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:34:01,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-26 21:34:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:01,686 INFO L225 Difference]: With dead ends: 72 [2018-10-26 21:34:01,686 INFO L226 Difference]: Without dead ends: 48 [2018-10-26 21:34:01,687 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:34:01,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-26 21:34:01,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-10-26 21:34:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-26 21:34:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-10-26 21:34:01,697 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-10-26 21:34:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:01,698 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-10-26 21:34:01,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:34:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-10-26 21:34:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:34:01,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:01,699 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:01,700 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:01,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-10-26 21:34:01,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:01,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:01,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:01,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:01,703 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 21:34:01,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:01,807 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:01,807 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-10-26 21:34:01,807 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-10-26 21:34:01,809 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:34:01,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:34:01,843 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 21:34:01,843 INFO L272 AbstractInterpreter]: Visited 16 different actions 46 times. Never merged. Widened at 2 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-10-26 21:34:01,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:01,856 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 21:34:01,881 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-10-26 21:34:01,881 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 21:34:01,986 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-10-26 21:34:01,986 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 21:34:01,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:34:01,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-10-26 21:34:01,987 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:34:01,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:34:01,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:34:01,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:34:01,987 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-10-26 21:34:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:02,755 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-10-26 21:34:02,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:34:02,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-10-26 21:34:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:02,756 INFO L225 Difference]: With dead ends: 87 [2018-10-26 21:34:02,756 INFO L226 Difference]: Without dead ends: 55 [2018-10-26 21:34:02,757 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:34:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-26 21:34:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-26 21:34:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-26 21:34:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-10-26 21:34:02,767 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-10-26 21:34:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:02,767 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-10-26 21:34:02,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:34:02,768 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-10-26 21:34:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 21:34:02,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:02,769 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:02,769 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:02,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:02,770 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-10-26 21:34:02,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:02,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:02,771 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 21:34:02,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:02,854 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:02,854 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:02,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:02,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:02,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/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-10-26 21:34:02,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:34:02,869 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 21:34:02,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 21:34:02,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:34:02,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 21:34:02,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 21:34:03,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:03,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-10-26 21:34:03,427 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:03,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:34:03,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:34:03,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:34:03,428 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-10-26 21:34:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:03,757 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-10-26 21:34:03,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:34:03,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-10-26 21:34:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:03,760 INFO L225 Difference]: With dead ends: 121 [2018-10-26 21:34:03,761 INFO L226 Difference]: Without dead ends: 76 [2018-10-26 21:34:03,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-10-26 21:34:03,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-26 21:34:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-10-26 21:34:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-26 21:34:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-10-26 21:34:03,773 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-10-26 21:34:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:03,773 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-10-26 21:34:03,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:34:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-10-26 21:34:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-26 21:34:03,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:03,774 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:03,775 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:03,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:03,775 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-10-26 21:34:03,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:03,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:34:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:03,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 21:34:03,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:03,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:03,866 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-10-26 21:34:03,867 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-10-26 21:34:03,868 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:34:03,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:34:04,594 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 21:34:04,594 INFO L272 AbstractInterpreter]: Visited 29 different actions 1315 times. Merged at 11 different actions 372 times. Widened at 2 different actions 46 times. Found 49 fixpoints after 6 different actions. Largest state had 5 variables. [2018-10-26 21:34:04,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:04,632 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 21:34:04,651 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-10-26 21:34:04,651 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 21:34:04,946 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-10-26 21:34:04,947 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 21:34:04,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:34:04,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-10-26 21:34:04,947 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:34:04,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:34:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:34:04,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:34:04,948 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2018-10-26 21:34:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:06,091 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-10-26 21:34:06,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:34:06,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-10-26 21:34:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:06,093 INFO L225 Difference]: With dead ends: 109 [2018-10-26 21:34:06,093 INFO L226 Difference]: Without dead ends: 68 [2018-10-26 21:34:06,094 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:34:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-26 21:34:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-26 21:34:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-26 21:34:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-10-26 21:34:06,107 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 55 [2018-10-26 21:34:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:06,107 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-10-26 21:34:06,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:34:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-10-26 21:34:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 21:34:06,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:06,109 INFO L375 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-10-26 21:34:06,110 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:06,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:06,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1768644787, now seen corresponding path program 1 times [2018-10-26 21:34:06,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:06,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:06,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:06,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:06,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 21:34:06,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:06,207 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:06,207 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-10-26 21:34:06,208 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-10-26 21:34:06,209 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:34:06,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:34:11,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 21:34:11,303 INFO L272 AbstractInterpreter]: Visited 34 different actions 21823 times. Merged at 14 different actions 4043 times. Widened at 4 different actions 328 times. Found 440 fixpoints after 9 different actions. Largest state had 5 variables. [2018-10-26 21:34:11,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:11,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 21:34:11,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:11,341 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 21:34:11,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:11,351 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:34:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:11,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:34:12,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:12,605 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-26 21:34:13,160 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 21:34:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 48 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 21:34:13,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:13,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 13] total 18 [2018-10-26 21:34:13,373 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:13,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:34:13,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:34:13,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-10-26 21:34:13,374 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 12 states. [2018-10-26 21:34:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:13,626 INFO L93 Difference]: Finished difference Result 144 states and 218 transitions. [2018-10-26 21:34:13,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 21:34:13,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-10-26 21:34:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:13,628 INFO L225 Difference]: With dead ends: 144 [2018-10-26 21:34:13,628 INFO L226 Difference]: Without dead ends: 95 [2018-10-26 21:34:13,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 117 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-10-26 21:34:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-26 21:34:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2018-10-26 21:34:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-26 21:34:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-10-26 21:34:13,642 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 67 [2018-10-26 21:34:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:13,642 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-10-26 21:34:13,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:34:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-10-26 21:34:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 21:34:13,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:13,644 INFO L375 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-10-26 21:34:13,646 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:13,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:13,646 INFO L82 PathProgramCache]: Analyzing trace with hash 650896746, now seen corresponding path program 1 times [2018-10-26 21:34:13,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:13,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:13,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:13,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:13,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 21:34:13,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:13,838 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:13,838 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-10-26 21:34:13,838 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-10-26 21:34:13,839 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:34:13,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:34:14,104 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 21:34:14,104 INFO L272 AbstractInterpreter]: Visited 29 different actions 1407 times. Merged at 11 different actions 329 times. Widened at 2 different actions 37 times. Found 41 fixpoints after 5 different actions. Largest state had 5 variables. [2018-10-26 21:34:14,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:14,149 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 21:34:14,168 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 50% of their original sizes. [2018-10-26 21:34:14,168 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 21:34:14,575 INFO L415 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2018-10-26 21:34:14,575 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 21:34:14,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:34:14,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [11] total 26 [2018-10-26 21:34:14,575 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:34:14,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 21:34:14,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 21:34:14,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-10-26 21:34:14,576 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 17 states. [2018-10-26 21:34:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:19,045 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2018-10-26 21:34:19,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 21:34:19,045 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-10-26 21:34:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:19,046 INFO L225 Difference]: With dead ends: 136 [2018-10-26 21:34:19,046 INFO L226 Difference]: Without dead ends: 88 [2018-10-26 21:34:19,047 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-10-26 21:34:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-26 21:34:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-10-26 21:34:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-26 21:34:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2018-10-26 21:34:19,066 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 81 [2018-10-26 21:34:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:19,066 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2018-10-26 21:34:19,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 21:34:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2018-10-26 21:34:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 21:34:19,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:19,068 INFO L375 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-10-26 21:34:19,068 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:19,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:19,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1708632044, now seen corresponding path program 2 times [2018-10-26 21:34:19,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:19,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:19,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:19,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:19,074 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 68 proven. 48 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-26 21:34:19,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:19,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:19,378 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:19,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:19,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:19,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:34:19,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:34:19,388 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 21:34:19,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 21:34:19,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:34:19,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 67 proven. 15 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-10-26 21:34:19,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 67 proven. 16 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-10-26 21:34:19,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:19,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 20 [2018-10-26 21:34:19,860 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:19,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 21:34:19,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 21:34:19,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-10-26 21:34:19,861 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 16 states. [2018-10-26 21:34:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:20,386 INFO L93 Difference]: Finished difference Result 218 states and 340 transitions. [2018-10-26 21:34:20,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-26 21:34:20,387 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-10-26 21:34:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:20,389 INFO L225 Difference]: With dead ends: 218 [2018-10-26 21:34:20,389 INFO L226 Difference]: Without dead ends: 147 [2018-10-26 21:34:20,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 202 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 21:34:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-26 21:34:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 117. [2018-10-26 21:34:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-26 21:34:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2018-10-26 21:34:20,419 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 108 [2018-10-26 21:34:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:20,419 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2018-10-26 21:34:20,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 21:34:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2018-10-26 21:34:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-26 21:34:20,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:20,422 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:20,422 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:20,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:20,422 INFO L82 PathProgramCache]: Analyzing trace with hash 184679354, now seen corresponding path program 3 times [2018-10-26 21:34:20,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:20,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:34:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:20,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2018-10-26 21:34:20,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:20,544 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:20,544 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:20,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:20,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:20,544 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:34:20,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 21:34:20,552 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 21:34:20,620 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 21:34:20,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:34:20,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 43 proven. 228 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2018-10-26 21:34:21,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 43 proven. 244 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-26 21:34:22,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:22,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 15] total 24 [2018-10-26 21:34:22,018 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:22,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 21:34:22,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 21:34:22,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-10-26 21:34:22,021 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand 17 states. [2018-10-26 21:34:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:22,571 INFO L93 Difference]: Finished difference Result 319 states and 576 transitions. [2018-10-26 21:34:22,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 21:34:22,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 161 [2018-10-26 21:34:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:22,577 INFO L225 Difference]: With dead ends: 319 [2018-10-26 21:34:22,578 INFO L226 Difference]: Without dead ends: 194 [2018-10-26 21:34:22,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 296 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2018-10-26 21:34:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-26 21:34:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2018-10-26 21:34:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-26 21:34:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2018-10-26 21:34:22,600 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 161 [2018-10-26 21:34:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:22,601 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2018-10-26 21:34:22,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 21:34:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2018-10-26 21:34:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 21:34:22,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:22,604 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 12, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:22,605 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:22,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:22,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1318513955, now seen corresponding path program 4 times [2018-10-26 21:34:22,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:22,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:22,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:34:22,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:22,607 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 136 proven. 285 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2018-10-26 21:34:22,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:22,886 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:22,886 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:22,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:22,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:22,886 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:34:22,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:22,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:34:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:22,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 65 proven. 353 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2018-10-26 21:34:23,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 65 proven. 377 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-10-26 21:34:24,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:24,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 17] total 28 [2018-10-26 21:34:24,189 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:24,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 21:34:24,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 21:34:24,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2018-10-26 21:34:24,190 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand 21 states. [2018-10-26 21:34:25,157 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-26 21:34:26,889 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-26 21:34:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:26,943 INFO L93 Difference]: Finished difference Result 399 states and 791 transitions. [2018-10-26 21:34:26,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-26 21:34:26,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 204 [2018-10-26 21:34:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:26,946 INFO L225 Difference]: With dead ends: 399 [2018-10-26 21:34:26,946 INFO L226 Difference]: Without dead ends: 251 [2018-10-26 21:34:26,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 381 SyntacticMatches, 15 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=446, Invalid=2310, Unknown=0, NotChecked=0, Total=2756 [2018-10-26 21:34:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-26 21:34:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 220. [2018-10-26 21:34:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-26 21:34:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 356 transitions. [2018-10-26 21:34:26,975 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 356 transitions. Word has length 204 [2018-10-26 21:34:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:26,975 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 356 transitions. [2018-10-26 21:34:26,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 21:34:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 356 transitions. [2018-10-26 21:34:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-26 21:34:26,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:26,984 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 26, 23, 23, 20, 18, 18, 18, 18, 18, 18, 18, 15, 11, 11, 11, 11, 11, 11, 11, 10, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:26,984 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:26,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:26,985 INFO L82 PathProgramCache]: Analyzing trace with hash 48873788, now seen corresponding path program 5 times [2018-10-26 21:34:26,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:26,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:26,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:26,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:26,986 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4879 backedges. 223 proven. 646 refuted. 0 times theorem prover too weak. 4010 trivial. 0 not checked. [2018-10-26 21:34:27,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:27,343 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:27,343 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:27,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:27,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:27,343 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:34:27,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:34:27,353 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 21:34:27,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-26 21:34:27,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:34:27,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4879 backedges. 1223 proven. 6 refuted. 0 times theorem prover too weak. 3650 trivial. 0 not checked. [2018-10-26 21:34:27,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4879 backedges. 633 proven. 39 refuted. 0 times theorem prover too weak. 4207 trivial. 0 not checked. [2018-10-26 21:34:28,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:28,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2018-10-26 21:34:28,851 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:28,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 21:34:28,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 21:34:28,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-10-26 21:34:28,854 INFO L87 Difference]: Start difference. First operand 220 states and 356 transitions. Second operand 16 states. [2018-10-26 21:34:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:29,050 INFO L93 Difference]: Finished difference Result 401 states and 692 transitions. [2018-10-26 21:34:29,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 21:34:29,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 407 [2018-10-26 21:34:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:29,054 INFO L225 Difference]: With dead ends: 401 [2018-10-26 21:34:29,054 INFO L226 Difference]: Without dead ends: 211 [2018-10-26 21:34:29,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 800 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2018-10-26 21:34:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-26 21:34:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-10-26 21:34:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-26 21:34:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 316 transitions. [2018-10-26 21:34:29,076 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 316 transitions. Word has length 407 [2018-10-26 21:34:29,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:29,077 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 316 transitions. [2018-10-26 21:34:29,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 21:34:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 316 transitions. [2018-10-26 21:34:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-26 21:34:29,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:29,085 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 27, 25, 25, 23, 17, 17, 17, 17, 17, 17, 17, 15, 12, 12, 12, 12, 12, 12, 12, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:29,085 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:29,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:29,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1968606914, now seen corresponding path program 6 times [2018-10-26 21:34:29,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:29,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:29,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:34:29,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:29,088 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4856 backedges. 364 proven. 445 refuted. 0 times theorem prover too weak. 4047 trivial. 0 not checked. [2018-10-26 21:34:29,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:29,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:29,732 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:29,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:29,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:29,733 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 21:34:29,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 21:34:29,743 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:34:29,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 21:34:29,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:34:29,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4856 backedges. 236 proven. 645 refuted. 0 times theorem prover too weak. 3975 trivial. 0 not checked. [2018-10-26 21:34:30,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4856 backedges. 236 proven. 661 refuted. 0 times theorem prover too weak. 3959 trivial. 0 not checked. [2018-10-26 21:34:31,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:31,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 15] total 20 [2018-10-26 21:34:31,165 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:31,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 21:34:31,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 21:34:31,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-10-26 21:34:31,167 INFO L87 Difference]: Start difference. First operand 211 states and 316 transitions. Second operand 14 states. [2018-10-26 21:34:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:31,381 INFO L93 Difference]: Finished difference Result 498 states and 947 transitions. [2018-10-26 21:34:31,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 21:34:31,382 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 411 [2018-10-26 21:34:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:31,385 INFO L225 Difference]: With dead ends: 498 [2018-10-26 21:34:31,385 INFO L226 Difference]: Without dead ends: 291 [2018-10-26 21:34:31,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 797 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-10-26 21:34:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-26 21:34:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 235. [2018-10-26 21:34:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-26 21:34:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 382 transitions. [2018-10-26 21:34:31,413 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 382 transitions. Word has length 411 [2018-10-26 21:34:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:31,414 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 382 transitions. [2018-10-26 21:34:31,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 21:34:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 382 transitions. [2018-10-26 21:34:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-10-26 21:34:31,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:31,419 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 43, 43, 37, 35, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 21, 21, 21, 21, 14, 14, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:31,419 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:31,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash 357894887, now seen corresponding path program 7 times [2018-10-26 21:34:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:31,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:34:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:31,421 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10865 backedges. 894 proven. 763 refuted. 0 times theorem prover too weak. 9208 trivial. 0 not checked. [2018-10-26 21:34:31,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:31,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:31,828 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:31,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:31,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:31,829 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/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-10-26 21:34:31,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:31,835 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:34:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:31,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10865 backedges. 302 proven. 1059 refuted. 0 times theorem prover too weak. 9504 trivial. 0 not checked. [2018-10-26 21:34:32,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10865 backedges. 304 proven. 1073 refuted. 0 times theorem prover too weak. 9488 trivial. 0 not checked. [2018-10-26 21:34:34,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:34,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 15] total 30 [2018-10-26 21:34:34,034 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:34,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-26 21:34:34,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-26 21:34:34,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2018-10-26 21:34:34,035 INFO L87 Difference]: Start difference. First operand 235 states and 382 transitions. Second operand 24 states. [2018-10-26 21:34:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:34,824 INFO L93 Difference]: Finished difference Result 485 states and 850 transitions. [2018-10-26 21:34:34,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-26 21:34:34,825 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 613 [2018-10-26 21:34:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:34,827 INFO L225 Difference]: With dead ends: 485 [2018-10-26 21:34:34,827 INFO L226 Difference]: Without dead ends: 267 [2018-10-26 21:34:34,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1272 GetRequests, 1203 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=469, Invalid=2837, Unknown=0, NotChecked=0, Total=3306 [2018-10-26 21:34:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-26 21:34:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 233. [2018-10-26 21:34:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-26 21:34:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 327 transitions. [2018-10-26 21:34:34,849 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 327 transitions. Word has length 613 [2018-10-26 21:34:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:34,849 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 327 transitions. [2018-10-26 21:34:34,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-26 21:34:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 327 transitions. [2018-10-26 21:34:34,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-10-26 21:34:34,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:34,854 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 28, 28, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 11, 11, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:34,854 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:34,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash 820996373, now seen corresponding path program 8 times [2018-10-26 21:34:34,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:34,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:34,855 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6468 backedges. 1229 proven. 156 refuted. 0 times theorem prover too weak. 5083 trivial. 0 not checked. [2018-10-26 21:34:35,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:35,157 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:35,157 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:35,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:35,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:35,158 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/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-10-26 21:34:35,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:34:35,165 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 21:34:35,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-10-26 21:34:35,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:34:35,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6468 backedges. 740 proven. 121 refuted. 0 times theorem prover too weak. 5607 trivial. 0 not checked. [2018-10-26 21:34:35,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6468 backedges. 744 proven. 127 refuted. 0 times theorem prover too weak. 5597 trivial. 0 not checked. [2018-10-26 21:34:36,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:36,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 13] total 25 [2018-10-26 21:34:36,482 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:36,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-26 21:34:36,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-26 21:34:36,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-10-26 21:34:36,483 INFO L87 Difference]: Start difference. First operand 233 states and 327 transitions. Second operand 20 states. [2018-10-26 21:34:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:38,110 INFO L93 Difference]: Finished difference Result 513 states and 793 transitions. [2018-10-26 21:34:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-26 21:34:38,111 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 477 [2018-10-26 21:34:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:38,114 INFO L225 Difference]: With dead ends: 513 [2018-10-26 21:34:38,114 INFO L226 Difference]: Without dead ends: 316 [2018-10-26 21:34:38,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 938 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=345, Invalid=1817, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 21:34:38,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-26 21:34:38,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 276. [2018-10-26 21:34:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-26 21:34:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 398 transitions. [2018-10-26 21:34:38,141 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 398 transitions. Word has length 477 [2018-10-26 21:34:38,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:38,142 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 398 transitions. [2018-10-26 21:34:38,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-26 21:34:38,142 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 398 transitions. [2018-10-26 21:34:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-26 21:34:38,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:38,148 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 25, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:38,148 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:38,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:38,148 INFO L82 PathProgramCache]: Analyzing trace with hash -322048271, now seen corresponding path program 9 times [2018-10-26 21:34:38,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:38,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:34:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:38,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 557 proven. 195 refuted. 0 times theorem prover too weak. 4264 trivial. 0 not checked. [2018-10-26 21:34:38,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:38,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:38,428 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:38,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:38,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:38,429 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 21:34:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 21:34:38,447 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:34:38,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 21:34:38,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:34:38,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 665 proven. 231 refuted. 0 times theorem prover too weak. 4120 trivial. 0 not checked. [2018-10-26 21:34:38,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:39,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 669 proven. 243 refuted. 0 times theorem prover too weak. 4104 trivial. 0 not checked. [2018-10-26 21:34:39,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:39,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 18 [2018-10-26 21:34:39,869 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:39,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:34:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:34:39,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-10-26 21:34:39,872 INFO L87 Difference]: Start difference. First operand 276 states and 398 transitions. Second operand 12 states. [2018-10-26 21:34:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:40,848 INFO L93 Difference]: Finished difference Result 309 states and 461 transitions. [2018-10-26 21:34:40,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:34:40,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 422 [2018-10-26 21:34:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:40,852 INFO L225 Difference]: With dead ends: 309 [2018-10-26 21:34:40,852 INFO L226 Difference]: Without dead ends: 302 [2018-10-26 21:34:40,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 827 SyntacticMatches, 13 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-10-26 21:34:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-26 21:34:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 279. [2018-10-26 21:34:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-26 21:34:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 412 transitions. [2018-10-26 21:34:40,874 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 412 transitions. Word has length 422 [2018-10-26 21:34:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:40,875 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 412 transitions. [2018-10-26 21:34:40,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:34:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 412 transitions. [2018-10-26 21:34:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-26 21:34:40,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:40,880 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 25, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:40,880 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:40,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:40,880 INFO L82 PathProgramCache]: Analyzing trace with hash -515597281, now seen corresponding path program 10 times [2018-10-26 21:34:40,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:40,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:40,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:34:40,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:40,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 385 proven. 976 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-10-26 21:34:41,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:41,430 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:41,430 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:41,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:41,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:41,431 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/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-10-26 21:34:41,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:41,440 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:34:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:41,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 397 proven. 499 refuted. 0 times theorem prover too weak. 4120 trivial. 0 not checked. [2018-10-26 21:34:41,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 399 proven. 513 refuted. 0 times theorem prover too weak. 4104 trivial. 0 not checked. [2018-10-26 21:34:43,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:43,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 15] total 29 [2018-10-26 21:34:43,273 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:43,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 21:34:43,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 21:34:43,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2018-10-26 21:34:43,274 INFO L87 Difference]: Start difference. First operand 279 states and 412 transitions. Second operand 23 states. [2018-10-26 21:34:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:44,115 INFO L93 Difference]: Finished difference Result 596 states and 956 transitions. [2018-10-26 21:34:44,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-26 21:34:44,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 422 [2018-10-26 21:34:44,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:44,118 INFO L225 Difference]: With dead ends: 596 [2018-10-26 21:34:44,119 INFO L226 Difference]: Without dead ends: 347 [2018-10-26 21:34:44,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 896 GetRequests, 824 SyntacticMatches, 13 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=559, Invalid=3101, Unknown=0, NotChecked=0, Total=3660 [2018-10-26 21:34:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-26 21:34:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 290. [2018-10-26 21:34:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-26 21:34:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 419 transitions. [2018-10-26 21:34:44,147 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 419 transitions. Word has length 422 [2018-10-26 21:34:44,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:44,147 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 419 transitions. [2018-10-26 21:34:44,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 21:34:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 419 transitions. [2018-10-26 21:34:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-26 21:34:44,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:44,154 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 35, 35, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 14, 13, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:44,154 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:44,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:44,154 INFO L82 PathProgramCache]: Analyzing trace with hash 141228388, now seen corresponding path program 11 times [2018-10-26 21:34:44,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:44,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:44,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:44,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:44,155 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10350 backedges. 1107 proven. 1012 refuted. 0 times theorem prover too weak. 8231 trivial. 0 not checked. [2018-10-26 21:34:44,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:44,627 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:44,627 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:44,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:44,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:44,627 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/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-10-26 21:34:44,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:34:44,647 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 21:34:44,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-10-26 21:34:44,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:34:44,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10350 backedges. 759 proven. 564 refuted. 0 times theorem prover too weak. 9027 trivial. 0 not checked. [2018-10-26 21:34:45,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10350 backedges. 761 proven. 580 refuted. 0 times theorem prover too weak. 9009 trivial. 0 not checked. [2018-10-26 21:34:46,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:46,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 15] total 30 [2018-10-26 21:34:46,598 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:46,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-26 21:34:46,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-26 21:34:46,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2018-10-26 21:34:46,599 INFO L87 Difference]: Start difference. First operand 290 states and 419 transitions. Second operand 24 states. [2018-10-26 21:34:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:48,132 INFO L93 Difference]: Finished difference Result 647 states and 1052 transitions. [2018-10-26 21:34:48,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-26 21:34:48,135 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 599 [2018-10-26 21:34:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:48,137 INFO L225 Difference]: With dead ends: 647 [2018-10-26 21:34:48,138 INFO L226 Difference]: Without dead ends: 246 [2018-10-26 21:34:48,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1241 GetRequests, 1177 SyntacticMatches, 13 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=422, Invalid=2334, Unknown=0, NotChecked=0, Total=2756 [2018-10-26 21:34:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-26 21:34:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 227. [2018-10-26 21:34:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-26 21:34:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2018-10-26 21:34:48,158 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 599 [2018-10-26 21:34:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:48,159 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2018-10-26 21:34:48,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-26 21:34:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2018-10-26 21:34:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-10-26 21:34:48,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:48,162 INFO L375 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-10-26 21:34:48,162 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:48,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:48,162 INFO L82 PathProgramCache]: Analyzing trace with hash -656328782, now seen corresponding path program 12 times [2018-10-26 21:34:48,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:48,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:48,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:34:48,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:48,163 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 341 proven. 1131 refuted. 0 times theorem prover too weak. 5368 trivial. 0 not checked. [2018-10-26 21:34:48,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:48,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:34:48,481 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:34:48,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:34:48,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:48,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/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-10-26 21:34:48,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 21:34:48,487 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 21:34:48,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 21:34:48,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:34:48,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 334 proven. 953 refuted. 0 times theorem prover too weak. 5553 trivial. 0 not checked. [2018-10-26 21:34:48,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:34:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 333 proven. 975 refuted. 0 times theorem prover too weak. 5532 trivial. 0 not checked. [2018-10-26 21:34:50,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:34:50,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 18] total 30 [2018-10-26 21:34:50,270 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:34:50,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-26 21:34:50,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-26 21:34:50,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2018-10-26 21:34:50,272 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand 22 states. [2018-10-26 21:34:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:50,786 INFO L93 Difference]: Finished difference Result 393 states and 477 transitions. [2018-10-26 21:34:50,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-26 21:34:50,787 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 490 [2018-10-26 21:34:50,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:50,788 INFO L225 Difference]: With dead ends: 393 [2018-10-26 21:34:50,788 INFO L226 Difference]: Without dead ends: 214 [2018-10-26 21:34:50,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 952 SyntacticMatches, 16 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 21:34:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-26 21:34:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196. [2018-10-26 21:34:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-26 21:34:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2018-10-26 21:34:50,802 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 490 [2018-10-26 21:34:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:50,802 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2018-10-26 21:34:50,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-26 21:34:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2018-10-26 21:34:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-26 21:34:50,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:50,807 INFO L375 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-10-26 21:34:50,807 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:50,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 13 times [2018-10-26 21:34:50,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:34:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:50,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:34:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:50,808 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:34:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:34:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:34:50,889 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 21:34:50,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:34:50 BoogieIcfgContainer [2018-10-26 21:34:50,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:34:50,939 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:34:50,939 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:34:50,940 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:34:50,940 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:34:00" (3/4) ... [2018-10-26 21:34:50,942 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 21:34:51,044 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b0f1c5b2-d041-43b8-9de9-a1a9ddaf9f58/bin-2019/utaipan/witness.graphml [2018-10-26 21:34:51,046 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:34:51,047 INFO L168 Benchmark]: Toolchain (without parser) took 51669.10 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 954.4 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 125.6 MB. Max. memory is 11.5 GB. [2018-10-26 21:34:51,047 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:34:51,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.77 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-10-26 21:34:51,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.40 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:34:51,048 INFO L168 Benchmark]: Boogie Preprocessor took 17.58 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:34:51,048 INFO L168 Benchmark]: RCFGBuilder took 451.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -206.6 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-10-26 21:34:51,048 INFO L168 Benchmark]: TraceAbstraction took 50905.51 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 157.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:34:51,048 INFO L168 Benchmark]: Witness Printer took 106.53 ms. Allocated memory is still 2.7 GB. Free memory is still 2.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:34:51,049 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.77 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.40 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.58 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 451.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -206.6 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50905.51 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 157.3 MB. Max. memory is 11.5 GB. * Witness Printer took 106.53 ms. Allocated memory is still 2.7 GB. Free memory is still 2.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] RET return fibo2(n-1) + fibo2(n-2); [L37] 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, 50.8s OverallTime, 20 OverallIterations, 46 TraceHistogramMax, 18.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 695 SDtfs, 1265 SDslu, 5629 SDs, 0 SdLazy, 7329 SolverSat, 1314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 9474 GetRequests, 8771 SyntacticMatches, 150 SemanticMatches, 553 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4901 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.4s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.959390862944163 AbsIntWeakeningRatio, 0.5685279187817259 AbsIntAvgWeakeningVarsNumRemoved, 1.6091370558375635 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 413 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 9557 NumberOfCodeBlocks, 8498 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 13482 ConstructedInterpolants, 0 QuantifiedInterpolants, 7458675 SizeOfPredicates, 83 NumberOfNonLiveVariables, 7346 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 45 InterpolantComputations, 2 PerfectInterpolantSequences, 154050/169436 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...