./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 08:58:00,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:58:00,689 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:58:00,697 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:58:00,697 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:58:00,698 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:58:00,699 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:58:00,700 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:58:00,701 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:58:00,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:58:00,702 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:58:00,702 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:58:00,703 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:58:00,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:58:00,704 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:58:00,705 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:58:00,705 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:58:00,707 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:58:00,708 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:58:00,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:58:00,710 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:58:00,711 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:58:00,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:58:00,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:58:00,713 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:58:00,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:58:00,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:58:00,715 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:58:00,715 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:58:00,716 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:58:00,716 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:58:00,717 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:58:00,717 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:58:00,717 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:58:00,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:58:00,718 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:58:00,718 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 08:58:00,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:58:00,729 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:58:00,730 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:58:00,730 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 08:58:00,730 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 08:58:00,730 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 08:58:00,730 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 08:58:00,730 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 08:58:00,731 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 08:58:00,731 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 08:58:00,731 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 08:58:00,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:58:00,732 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:58:00,732 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:58:00,732 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:58:00,732 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:58:00,732 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:58:00,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:58:00,733 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:58:00,733 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:58:00,733 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:58:00,733 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:58:00,733 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:58:00,733 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:58:00,733 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:58:00,734 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:58:00,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:58:00,734 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:58:00,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:58:00,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:58:00,734 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 08:58:00,734 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:58:00,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:58:00,734 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 08:58:00,734 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_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2018-11-10 08:58:00,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:58:00,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:58:00,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:58:00,769 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:58:00,769 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:58:00,770 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-10 08:58:00,806 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/data/20409686f/70643ea9c4004665b20a84a9f318b524/FLAG6f7da740e [2018-11-10 08:58:01,198 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:58:01,199 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-10 08:58:01,203 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/data/20409686f/70643ea9c4004665b20a84a9f318b524/FLAG6f7da740e [2018-11-10 08:58:01,212 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/data/20409686f/70643ea9c4004665b20a84a9f318b524 [2018-11-10 08:58:01,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:58:01,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:58:01,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:58:01,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:58:01,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:58:01,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:58:01" (1/1) ... [2018-11-10 08:58:01,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31137421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01, skipping insertion in model container [2018-11-10 08:58:01,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:58:01" (1/1) ... [2018-11-10 08:58:01,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:58:01,239 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:58:01,330 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:58:01,332 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:58:01,343 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:58:01,350 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:58:01,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01 WrapperNode [2018-11-10 08:58:01,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:58:01,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:58:01,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:58:01,351 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:58:01,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01" (1/1) ... [2018-11-10 08:58:01,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01" (1/1) ... [2018-11-10 08:58:01,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:58:01,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:58:01,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:58:01,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:58:01,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01" (1/1) ... [2018-11-10 08:58:01,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01" (1/1) ... [2018-11-10 08:58:01,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01" (1/1) ... [2018-11-10 08:58:01,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01" (1/1) ... [2018-11-10 08:58:01,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01" (1/1) ... [2018-11-10 08:58:01,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01" (1/1) ... [2018-11-10 08:58:01,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01" (1/1) ... [2018-11-10 08:58:01,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:58:01,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:58:01,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:58:01,375 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:58:01,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:58:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:58:01,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:58:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:58:01,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:58:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:58:01,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:58:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-10 08:58:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-10 08:58:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-10 08:58:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-10 08:58:01,576 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:58:01,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:58:01 BoogieIcfgContainer [2018-11-10 08:58:01,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:58:01,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:58:01,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:58:01,579 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:58:01,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:58:01" (1/3) ... [2018-11-10 08:58:01,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56130d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:58:01, skipping insertion in model container [2018-11-10 08:58:01,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:58:01" (2/3) ... [2018-11-10 08:58:01,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56130d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:58:01, skipping insertion in model container [2018-11-10 08:58:01,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:58:01" (3/3) ... [2018-11-10 08:58:01,583 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-10 08:58:01,591 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:58:01,599 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 08:58:01,609 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 08:58:01,635 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:58:01,635 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 08:58:01,635 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:58:01,636 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:58:01,636 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:58:01,636 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:58:01,636 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:58:01,636 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:58:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-10 08:58:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 08:58:01,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:01,658 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:01,660 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:01,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-10 08:58:01,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:01,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:01,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:01,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:01,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:58:01,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:58:01,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:58:01,796 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:58:01,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:58:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:58:01,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:58:01,809 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-10 08:58:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:01,890 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-10 08:58:01,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:58:01,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 08:58:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:01,897 INFO L225 Difference]: With dead ends: 44 [2018-11-10 08:58:01,897 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 08:58:01,899 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-11-10 08:58:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 08:58:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 08:58:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 08:58:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-10 08:58:01,926 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-10 08:58:01,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:01,927 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-10 08:58:01,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:58:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-10 08:58:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 08:58:01,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:01,928 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:01,928 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:01,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-10 08:58:01,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:01,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:01,930 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:58:01,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:58:01,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:58:01,979 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:58:01,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:58:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:58:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:58:01,981 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-10 08:58:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:02,057 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-10 08:58:02,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:58:02,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 08:58:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:02,058 INFO L225 Difference]: With dead ends: 36 [2018-11-10 08:58:02,058 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 08:58:02,059 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-11-10 08:58:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 08:58:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-10 08:58:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 08:58:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-10 08:58:02,064 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-10 08:58:02,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:02,065 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-10 08:58:02,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:58:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-10 08:58:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 08:58:02,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:02,066 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:02,066 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:02,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:02,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-10 08:58:02,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:02,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:02,068 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 08:58:02,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:02,139 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:02,140 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-10 08:58:02,142 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-11-10 08:58:02,174 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:02,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:02,260 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:58:02,261 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Never found a fixpoint. Largest state had 5 variables. [2018-11-10 08:58:02,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:02,266 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:58:02,313 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 08:58:02,313 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:58:02,347 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-10 08:58:02,347 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:58:02,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:58:02,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-10 08:58:02,348 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:58:02,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 08:58:02,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:58:02,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:58:02,349 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-11-10 08:58:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:02,546 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-11-10 08:58:02,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:58:02,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-10 08:58:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:02,547 INFO L225 Difference]: With dead ends: 72 [2018-11-10 08:58:02,547 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 08:58:02,548 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:58:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 08:58:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-10 08:58:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 08:58:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-10 08:58:02,557 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-11-10 08:58:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:02,557 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-10 08:58:02,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 08:58:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-10 08:58:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 08:58:02,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:02,559 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:02,559 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:02,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-10 08:58:02,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:02,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:02,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:02,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:02,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:58:02,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:02,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:02,605 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-10 08:58:02,605 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 08:58:02,607 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:02,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:02,634 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:58:02,634 INFO L272 AbstractInterpreter]: Visited 16 different actions 45 times. Never merged. Widened at 2 different actions 3 times. Never found a fixpoint. Largest state had 5 variables. [2018-11-10 08:58:02,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:02,636 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:58:02,657 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 08:58:02,657 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:58:02,700 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-10 08:58:02,700 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:58:02,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:58:02,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-10 08:58:02,700 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:58:02,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:58:02,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:58:02,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:58:02,701 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-11-10 08:58:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:03,003 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-11-10 08:58:03,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 08:58:03,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-10 08:58:03,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:03,004 INFO L225 Difference]: With dead ends: 87 [2018-11-10 08:58:03,004 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 08:58:03,005 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:58:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 08:58:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-10 08:58:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 08:58:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-10 08:58:03,013 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-11-10 08:58:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:03,013 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-10 08:58:03,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:58:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-10 08:58:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 08:58:03,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:03,015 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:03,015 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:03,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:03,015 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-11-10 08:58:03,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:03,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:03,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:03,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:03,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 08:58:03,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:03,062 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:03,062 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:58:03,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:58:03,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:03,063 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:03,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:58:03,075 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:58:03,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 08:58:03,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:58:03,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 08:58:03,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 08:58:03,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:58:03,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-11-10 08:58:03,455 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:58:03,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 08:58:03,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 08:58:03,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-10 08:58:03,456 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-11-10 08:58:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:03,627 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-11-10 08:58:03,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 08:58:03,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-10 08:58:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:03,630 INFO L225 Difference]: With dead ends: 121 [2018-11-10 08:58:03,631 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 08:58:03,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-11-10 08:58:03,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 08:58:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-10 08:58:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 08:58:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-10 08:58:03,640 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-11-10 08:58:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:03,641 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-10 08:58:03,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 08:58:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-10 08:58:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 08:58:03,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:03,642 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:03,643 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:03,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:03,643 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-11-10 08:58:03,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:03,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:03,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:58:03,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:03,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 08:58:03,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:03,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:03,688 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 08:58:03,689 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 08:58:03,690 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:03,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:03,783 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:58:03,784 INFO L272 AbstractInterpreter]: Visited 29 different actions 154 times. Merged at 10 different actions 16 times. Widened at 2 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-10 08:58:03,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:03,786 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:58:03,815 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 08:58:03,815 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:58:03,943 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-10 08:58:03,943 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:58:03,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:58:03,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-11-10 08:58:03,944 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:58:03,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 08:58:03,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 08:58:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-10 08:58:03,945 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 15 states. [2018-11-10 08:58:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:04,459 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2018-11-10 08:58:04,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 08:58:04,460 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-10 08:58:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:04,460 INFO L225 Difference]: With dead ends: 118 [2018-11-10 08:58:04,461 INFO L226 Difference]: Without dead ends: 77 [2018-11-10 08:58:04,461 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-11-10 08:58:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-10 08:58:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-10 08:58:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 08:58:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-11-10 08:58:04,469 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 55 [2018-11-10 08:58:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:04,469 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-11-10 08:58:04,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 08:58:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-11-10 08:58:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 08:58:04,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:04,471 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:04,471 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:04,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:04,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1937391112, now seen corresponding path program 1 times [2018-11-10 08:58:04,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:04,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:04,472 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 26 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-10 08:58:04,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:04,521 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:04,521 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-11-10 08:58:04,521 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 08:58:04,522 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:04,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:04,547 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:58:04,547 INFO L272 AbstractInterpreter]: Visited 27 different actions 84 times. Merged at 7 different actions 9 times. Widened at 2 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-10 08:58:04,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:04,553 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:58:04,572 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 08:58:04,572 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:58:04,650 INFO L415 sIntCurrentIteration]: We unified 79 AI predicates to 79 [2018-11-10 08:58:04,651 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:58:04,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:58:04,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-10 08:58:04,651 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:58:04,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 08:58:04,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 08:58:04,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:58:04,652 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 13 states. [2018-11-10 08:58:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:05,149 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2018-11-10 08:58:05,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 08:58:05,150 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-11-10 08:58:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:05,151 INFO L225 Difference]: With dead ends: 141 [2018-11-10 08:58:05,151 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 08:58:05,151 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-10 08:58:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 08:58:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-10 08:58:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 08:58:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-11-10 08:58:05,160 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 80 [2018-11-10 08:58:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:05,161 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-11-10 08:58:05,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 08:58:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-11-10 08:58:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 08:58:05,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:05,163 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:05,163 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:05,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:05,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1541382103, now seen corresponding path program 1 times [2018-11-10 08:58:05,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:05,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:05,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:05,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:05,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 55 proven. 13 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 08:58:05,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:05,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:05,222 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-11-10 08:58:05,223 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 08:58:05,224 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:05,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:05,356 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:58:05,356 INFO L272 AbstractInterpreter]: Visited 34 different actions 443 times. Merged at 13 different actions 36 times. Widened at 2 different actions 3 times. Found 3 fixpoints after 3 different actions. Largest state had 5 variables. [2018-11-10 08:58:05,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:05,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:58:05,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:05,373 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:05,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:05,378 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:58:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:05,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 08:58:05,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 72 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 08:58:05,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:58:05,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 13] total 17 [2018-11-10 08:58:05,938 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:58:05,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 08:58:05,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 08:58:05,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-10 08:58:05,939 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 12 states. [2018-11-10 08:58:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:06,100 INFO L93 Difference]: Finished difference Result 212 states and 335 transitions. [2018-11-10 08:58:06,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 08:58:06,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-10 08:58:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:06,102 INFO L225 Difference]: With dead ends: 212 [2018-11-10 08:58:06,102 INFO L226 Difference]: Without dead ends: 134 [2018-11-10 08:58:06,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 167 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-11-10 08:58:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-10 08:58:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2018-11-10 08:58:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 08:58:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2018-11-10 08:58:06,119 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 94 [2018-11-10 08:58:06,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:06,119 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2018-11-10 08:58:06,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 08:58:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2018-11-10 08:58:06,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 08:58:06,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:06,121 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:06,121 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:06,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:06,121 INFO L82 PathProgramCache]: Analyzing trace with hash 721741772, now seen corresponding path program 2 times [2018-11-10 08:58:06,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:06,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:06,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:06,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:06,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 72 proven. 54 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-10 08:58:06,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:06,215 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:06,215 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:58:06,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:58:06,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:06,215 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:06,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:58:06,224 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:58:06,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 08:58:06,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:58:06,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 78 proven. 17 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-10 08:58:06,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 78 proven. 19 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-10 08:58:06,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:58:06,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 18 [2018-11-10 08:58:06,506 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:58:06,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 08:58:06,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 08:58:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-10 08:58:06,506 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand 15 states. [2018-11-10 08:58:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:06,839 INFO L93 Difference]: Finished difference Result 231 states and 386 transitions. [2018-11-10 08:58:06,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 08:58:06,839 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 110 [2018-11-10 08:58:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:06,842 INFO L225 Difference]: With dead ends: 231 [2018-11-10 08:58:06,842 INFO L226 Difference]: Without dead ends: 165 [2018-11-10 08:58:06,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 207 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-11-10 08:58:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-10 08:58:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 144. [2018-11-10 08:58:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 08:58:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2018-11-10 08:58:06,860 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 110 [2018-11-10 08:58:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:06,861 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2018-11-10 08:58:06,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 08:58:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2018-11-10 08:58:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 08:58:06,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:06,863 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 8, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:06,864 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:06,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:06,864 INFO L82 PathProgramCache]: Analyzing trace with hash 20653140, now seen corresponding path program 3 times [2018-11-10 08:58:06,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:06,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:06,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:58:06,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:06,865 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 146 proven. 21 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2018-11-10 08:58:06,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:06,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:06,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:58:06,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:58:06,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:06,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:06,998 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:58:06,998 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:58:07,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:58:07,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:58:07,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 84 proven. 111 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-11-10 08:58:07,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 84 proven. 116 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2018-11-10 08:58:07,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:58:07,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 19 [2018-11-10 08:58:07,527 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:58:07,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 08:58:07,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 08:58:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-11-10 08:58:07,528 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand 15 states. [2018-11-10 08:58:07,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:07,771 INFO L93 Difference]: Finished difference Result 296 states and 486 transitions. [2018-11-10 08:58:07,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 08:58:07,771 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 162 [2018-11-10 08:58:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:07,774 INFO L225 Difference]: With dead ends: 296 [2018-11-10 08:58:07,774 INFO L226 Difference]: Without dead ends: 188 [2018-11-10 08:58:07,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 306 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2018-11-10 08:58:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-10 08:58:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 164. [2018-11-10 08:58:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-10 08:58:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 245 transitions. [2018-11-10 08:58:07,790 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 245 transitions. Word has length 162 [2018-11-10 08:58:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:07,791 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 245 transitions. [2018-11-10 08:58:07,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 08:58:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 245 transitions. [2018-11-10 08:58:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-10 08:58:07,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:07,794 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 14, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:07,794 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:07,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:07,795 INFO L82 PathProgramCache]: Analyzing trace with hash -948251209, now seen corresponding path program 4 times [2018-11-10 08:58:07,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:07,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:07,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:58:07,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:07,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 200 proven. 148 refuted. 0 times theorem prover too weak. 1069 trivial. 0 not checked. [2018-11-10 08:58:07,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:07,914 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:07,914 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:58:07,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:58:07,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:07,915 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:07,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:07,925 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:58:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:07,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 179 proven. 217 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2018-11-10 08:58:08,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 177 proven. 227 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2018-11-10 08:58:08,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:58:08,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 23 [2018-11-10 08:58:08,716 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:58:08,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 08:58:08,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 08:58:08,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-11-10 08:58:08,717 INFO L87 Difference]: Start difference. First operand 164 states and 245 transitions. Second operand 17 states. [2018-11-10 08:58:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:08,958 INFO L93 Difference]: Finished difference Result 365 states and 653 transitions. [2018-11-10 08:58:08,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 08:58:08,958 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 232 [2018-11-10 08:58:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:08,961 INFO L225 Difference]: With dead ends: 365 [2018-11-10 08:58:08,961 INFO L226 Difference]: Without dead ends: 190 [2018-11-10 08:58:08,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 441 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2018-11-10 08:58:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-10 08:58:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 179. [2018-11-10 08:58:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-10 08:58:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 271 transitions. [2018-11-10 08:58:08,979 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 271 transitions. Word has length 232 [2018-11-10 08:58:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:08,979 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 271 transitions. [2018-11-10 08:58:08,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 08:58:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 271 transitions. [2018-11-10 08:58:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 08:58:08,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:08,982 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:08,982 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:08,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:08,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1691565713, now seen corresponding path program 5 times [2018-11-10 08:58:08,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:08,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:08,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:08,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:08,984 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 181 proven. 52 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-11-10 08:58:09,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:09,126 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:09,127 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:58:09,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:58:09,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:09,127 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:09,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:58:09,137 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:58:09,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 08:58:09,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:58:09,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 233 proven. 25 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-10 08:58:09,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 233 proven. 25 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-10 08:58:09,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:58:09,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 23 [2018-11-10 08:58:09,801 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:58:09,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 08:58:09,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 08:58:09,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-11-10 08:58:09,802 INFO L87 Difference]: Start difference. First operand 179 states and 271 transitions. Second operand 19 states. [2018-11-10 08:58:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:10,182 INFO L93 Difference]: Finished difference Result 368 states and 624 transitions. [2018-11-10 08:58:10,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 08:58:10,183 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 177 [2018-11-10 08:58:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:10,185 INFO L225 Difference]: With dead ends: 368 [2018-11-10 08:58:10,185 INFO L226 Difference]: Without dead ends: 205 [2018-11-10 08:58:10,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 336 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 08:58:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-10 08:58:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 178. [2018-11-10 08:58:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-10 08:58:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 254 transitions. [2018-11-10 08:58:10,204 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 254 transitions. Word has length 177 [2018-11-10 08:58:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:10,204 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 254 transitions. [2018-11-10 08:58:10,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 08:58:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2018-11-10 08:58:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 08:58:10,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:10,208 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 12, 12, 12, 11, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:10,208 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:10,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:10,208 INFO L82 PathProgramCache]: Analyzing trace with hash 229545853, now seen corresponding path program 6 times [2018-11-10 08:58:10,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:10,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:58:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:10,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 159 proven. 139 refuted. 0 times theorem prover too weak. 803 trivial. 0 not checked. [2018-11-10 08:58:10,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:10,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:10,325 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:58:10,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:58:10,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:10,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:10,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:58:10,333 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:58:10,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:58:10,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:58:10,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 128 proven. 152 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2018-11-10 08:58:10,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 129 proven. 155 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-11-10 08:58:10,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:58:10,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 23 [2018-11-10 08:58:10,987 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:58:10,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 08:58:10,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 08:58:10,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-11-10 08:58:10,988 INFO L87 Difference]: Start difference. First operand 178 states and 254 transitions. Second operand 18 states. [2018-11-10 08:58:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:11,197 INFO L93 Difference]: Finished difference Result 331 states and 512 transitions. [2018-11-10 08:58:11,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 08:58:11,201 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 204 [2018-11-10 08:58:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:11,203 INFO L225 Difference]: With dead ends: 331 [2018-11-10 08:58:11,203 INFO L226 Difference]: Without dead ends: 189 [2018-11-10 08:58:11,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 387 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 08:58:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-10 08:58:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 181. [2018-11-10 08:58:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-10 08:58:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 251 transitions. [2018-11-10 08:58:11,219 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 251 transitions. Word has length 204 [2018-11-10 08:58:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:11,220 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 251 transitions. [2018-11-10 08:58:11,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 08:58:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 251 transitions. [2018-11-10 08:58:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 08:58:11,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:11,222 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:58:11,222 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:11,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:11,222 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 7 times [2018-11-10 08:58:11,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:11,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:11,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:58:11,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:11,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:58:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:58:11,263 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 08:58:11,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:58:11 BoogieIcfgContainer [2018-11-10 08:58:11,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 08:58:11,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:58:11,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:58:11,293 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:58:11,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:58:01" (3/4) ... [2018-11-10 08:58:11,295 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 08:58:11,349 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c0e67108-e7b7-4321-9cef-845e40a4a941/bin-2019/utaipan/witness.graphml [2018-11-10 08:58:11,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:58:11,350 INFO L168 Benchmark]: Toolchain (without parser) took 10135.26 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 477.1 MB). Free memory was 958.1 MB in the beginning and 1.4 GB in the end (delta: -432.9 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:11,351 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:58:11,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 134.74 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:11,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.04 ms. Allocated memory is still 1.0 GB. Free memory is still 947.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:58:11,352 INFO L168 Benchmark]: Boogie Preprocessor took 10.92 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 944.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:11,352 INFO L168 Benchmark]: RCFGBuilder took 201.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:11,352 INFO L168 Benchmark]: TraceAbstraction took 9715.18 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -249.6 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:11,352 INFO L168 Benchmark]: Witness Printer took 57.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:58:11,354 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 134.74 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.2 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 12.04 ms. Allocated memory is still 1.0 GB. Free memory is still 947.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.92 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 944.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 201.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9715.18 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -249.6 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. * Witness Printer took 57.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] 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); [L37] EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 9.6s OverallTime, 14 OverallIterations, 17 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 458 SDtfs, 551 SDslu, 3225 SDs, 0 SdLazy, 2786 SolverSat, 474 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2416 GetRequests, 2100 SyntacticMatches, 66 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.959183673469388 AbsIntWeakeningRatio, 0.5714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 1.2857142857142858 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 157 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2466 NumberOfCodeBlocks, 2243 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3293 ConstructedInterpolants, 0 QuantifiedInterpolants, 786283 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1767 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 27 InterpolantComputations, 2 PerfectInterpolantSequences, 11867/13564 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...