./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/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 fe571d33601eb001defa960d70b02ea99b59263c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 06:48:04,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 06:48:04,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 06:48:04,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 06:48:04,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 06:48:04,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 06:48:04,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 06:48:04,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 06:48:04,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 06:48:04,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 06:48:04,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 06:48:04,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 06:48:04,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 06:48:04,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 06:48:04,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 06:48:04,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 06:48:04,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 06:48:04,479 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 06:48:04,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 06:48:04,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 06:48:04,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 06:48:04,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 06:48:04,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 06:48:04,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 06:48:04,483 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 06:48:04,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 06:48:04,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 06:48:04,485 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 06:48:04,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 06:48:04,486 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 06:48:04,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 06:48:04,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 06:48:04,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 06:48:04,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 06:48:04,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 06:48:04,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 06:48:04,487 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 06:48:04,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 06:48:04,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 06:48:04,495 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 06:48:04,495 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 06:48:04,495 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 06:48:04,495 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 06:48:04,496 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 06:48:04,496 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 06:48:04,496 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 06:48:04,496 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 06:48:04,496 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 06:48:04,496 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 06:48:04,496 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 06:48:04,496 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 06:48:04,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 06:48:04,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 06:48:04,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 06:48:04,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 06:48:04,497 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 06:48:04,497 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 06:48:04,497 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 06:48:04,497 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 06:48:04,497 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 06:48:04,497 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 06:48:04,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 06:48:04,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 06:48:04,498 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 06:48:04,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 06:48:04,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 06:48:04,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 06:48:04,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 06:48:04,498 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 06:48:04,498 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 06:48:04,498 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 06:48:04,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 06:48:04,498 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 06:48:04,498 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_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/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 -> fe571d33601eb001defa960d70b02ea99b59263c [2018-12-09 06:48:04,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 06:48:04,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 06:48:04,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 06:48:04,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 06:48:04,529 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 06:48:04,529 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-12-09 06:48:04,570 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/data/9f3b94a52/27db023804f4452f816af200e7f1cc85/FLAG4f86d8155 [2018-12-09 06:48:04,855 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 06:48:04,855 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-12-09 06:48:04,859 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/data/9f3b94a52/27db023804f4452f816af200e7f1cc85/FLAG4f86d8155 [2018-12-09 06:48:04,868 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/data/9f3b94a52/27db023804f4452f816af200e7f1cc85 [2018-12-09 06:48:04,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 06:48:04,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 06:48:04,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 06:48:04,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 06:48:04,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 06:48:04,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:48:04" (1/1) ... [2018-12-09 06:48:04,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c04efe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04, skipping insertion in model container [2018-12-09 06:48:04,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:48:04" (1/1) ... [2018-12-09 06:48:04,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 06:48:04,889 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 06:48:04,974 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:48:04,976 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 06:48:04,985 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:48:04,994 INFO L195 MainTranslator]: Completed translation [2018-12-09 06:48:04,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04 WrapperNode [2018-12-09 06:48:04,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 06:48:04,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 06:48:04,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 06:48:04,995 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 06:48:05,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04" (1/1) ... [2018-12-09 06:48:05,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04" (1/1) ... [2018-12-09 06:48:05,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 06:48:05,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 06:48:05,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 06:48:05,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 06:48:05,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04" (1/1) ... [2018-12-09 06:48:05,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04" (1/1) ... [2018-12-09 06:48:05,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04" (1/1) ... [2018-12-09 06:48:05,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04" (1/1) ... [2018-12-09 06:48:05,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04" (1/1) ... [2018-12-09 06:48:05,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04" (1/1) ... [2018-12-09 06:48:05,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04" (1/1) ... [2018-12-09 06:48:05,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 06:48:05,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 06:48:05,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 06:48:05,018 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 06:48:05,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 06:48:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 06:48:05,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 06:48:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 06:48:05,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 06:48:05,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 06:48:05,085 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 06:48:05,085 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-09 06:48:05,085 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-09 06:48:05,085 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-09 06:48:05,085 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-09 06:48:05,186 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 06:48:05,187 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 06:48:05,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:48:05 BoogieIcfgContainer [2018-12-09 06:48:05,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 06:48:05,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 06:48:05,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 06:48:05,190 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 06:48:05,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:48:04" (1/3) ... [2018-12-09 06:48:05,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243050a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:48:05, skipping insertion in model container [2018-12-09 06:48:05,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:04" (2/3) ... [2018-12-09 06:48:05,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243050a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:48:05, skipping insertion in model container [2018-12-09 06:48:05,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:48:05" (3/3) ... [2018-12-09 06:48:05,193 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5_false-unreach-call_true-termination.c [2018-12-09 06:48:05,201 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 06:48:05,206 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 06:48:05,218 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 06:48:05,243 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 06:48:05,243 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 06:48:05,243 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 06:48:05,243 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 06:48:05,243 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 06:48:05,244 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 06:48:05,244 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 06:48:05,244 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 06:48:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-09 06:48:05,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 06:48:05,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:05,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:05,261 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:05,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:05,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-09 06:48:05,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:05,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:05,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:05,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:05,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:48:05,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:48:05,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:48:05,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:48:05,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:48:05,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:48:05,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:48:05,384 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-09 06:48:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:05,446 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-09 06:48:05,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 06:48:05,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 06:48:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:05,453 INFO L225 Difference]: With dead ends: 44 [2018-12-09 06:48:05,453 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 06:48:05,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 06:48:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 06:48:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 06:48:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 06:48:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 06:48:05,480 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-09 06:48:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:05,480 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 06:48:05,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:48:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 06:48:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 06:48:05,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:05,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:05,481 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:05,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-09 06:48:05,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:05,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:05,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:48:05,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:48:05,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:48:05,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:48:05,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:48:05,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:48:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:48:05,508 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-09 06:48:05,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:05,550 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-09 06:48:05,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 06:48:05,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 06:48:05,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:05,551 INFO L225 Difference]: With dead ends: 36 [2018-12-09 06:48:05,551 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 06:48:05,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 06:48:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 06:48:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-09 06:48:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 06:48:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 06:48:05,556 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-09 06:48:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:05,556 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 06:48:05,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:48:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 06:48:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 06:48:05,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:05,557 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:05,557 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:05,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:05,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-09 06:48:05,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:05,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:05,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:05,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 06:48:05,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:05,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 06:48:05,601 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-09 06:48:05,602 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-12-09 06:48:05,622 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 06:48:05,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 06:48:05,684 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 06:48:05,684 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-09 06:48:05,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:05,692 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 06:48:05,718 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 06:48:05,718 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 06:48:05,732 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-09 06:48:05,732 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 06:48:05,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 06:48:05,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-12-09 06:48:05,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:48:05,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 06:48:05,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 06:48:05,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:48:05,733 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-12-09 06:48:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:05,850 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-12-09 06:48:05,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 06:48:05,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 06:48:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:05,851 INFO L225 Difference]: With dead ends: 72 [2018-12-09 06:48:05,851 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 06:48:05,852 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 06:48:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 06:48:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-09 06:48:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 06:48:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-09 06:48:05,857 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-12-09 06:48:05,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:05,858 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-09 06:48:05,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 06:48:05,858 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-09 06:48:05,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 06:48:05,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:05,859 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:05,859 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:05,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:05,859 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-09 06:48:05,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:05,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:05,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 06:48:05,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:05,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 06:48:05,903 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-09 06:48:05,903 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-09 06:48:05,904 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 06:48:05,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 06:48:05,914 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 06:48:05,914 INFO L272 AbstractInterpreter]: Visited 16 different actions 30 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-09 06:48:05,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:05,915 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 06:48:05,927 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 06:48:05,927 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 06:48:05,960 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-09 06:48:05,960 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 06:48:05,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 06:48:05,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-09 06:48:05,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:48:05,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 06:48:05,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 06:48:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 06:48:05,961 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-12-09 06:48:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:06,131 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-09 06:48:06,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 06:48:06,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-12-09 06:48:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:06,132 INFO L225 Difference]: With dead ends: 87 [2018-12-09 06:48:06,132 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 06:48:06,133 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-09 06:48:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 06:48:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-09 06:48:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 06:48:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-12-09 06:48:06,138 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-12-09 06:48:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:06,138 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-12-09 06:48:06,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 06:48:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-12-09 06:48:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 06:48:06,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:06,139 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:06,139 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:06,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:06,140 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-12-09 06:48:06,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:06,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:06,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:06,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:06,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 06:48:06,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:06,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 06:48:06,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 06:48:06,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 06:48:06,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:06,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:48:06,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 06:48:06,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 06:48:06,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 06:48:06,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:48:06,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:48:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 06:48:06,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 06:48:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 06:48:06,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 06:48:06,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-12-09 06:48:06,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 06:48:06,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 06:48:06,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 06:48:06,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-09 06:48:06,517 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-12-09 06:48:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:06,679 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-12-09 06:48:06,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 06:48:06,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-12-09 06:48:06,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:06,681 INFO L225 Difference]: With dead ends: 121 [2018-12-09 06:48:06,681 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 06:48:06,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-12-09 06:48:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 06:48:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-12-09 06:48:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 06:48:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-12-09 06:48:06,689 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-12-09 06:48:06,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:06,689 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-12-09 06:48:06,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 06:48:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-12-09 06:48:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 06:48:06,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:06,690 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:06,690 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:06,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-12-09 06:48:06,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:06,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:48:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:06,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 06:48:06,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:06,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 06:48:06,737 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-09 06:48:06,737 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-09 06:48:06,738 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 06:48:06,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 06:48:06,748 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 06:48:06,748 INFO L272 AbstractInterpreter]: Visited 21 different actions 38 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-09 06:48:06,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:06,749 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 06:48:06,763 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 06:48:06,763 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 06:48:06,804 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-09 06:48:06,804 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 06:48:06,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 06:48:06,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-12-09 06:48:06,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:48:06,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 06:48:06,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 06:48:06,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 06:48:06,805 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2018-12-09 06:48:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:07,009 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-12-09 06:48:07,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 06:48:07,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-12-09 06:48:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:07,010 INFO L225 Difference]: With dead ends: 109 [2018-12-09 06:48:07,010 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 06:48:07,011 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-09 06:48:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 06:48:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-09 06:48:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 06:48:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-12-09 06:48:07,016 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 55 [2018-12-09 06:48:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:07,016 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-12-09 06:48:07,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 06:48:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-12-09 06:48:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 06:48:07,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:07,017 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:07,017 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:07,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:07,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1768644787, now seen corresponding path program 1 times [2018-12-09 06:48:07,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:07,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:07,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:07,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:07,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 06:48:07,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:07,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 06:48:07,047 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-12-09 06:48:07,047 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-09 06:48:07,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 06:48:07,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 06:48:07,076 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 06:48:07,076 INFO L272 AbstractInterpreter]: Visited 34 different actions 136 times. Never merged. Never widened. Performed 279 root evaluator evaluations with a maximum evaluation depth of 4. Performed 279 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 5 variables. [2018-12-09 06:48:07,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:07,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 06:48:07,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:07,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:48:07,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:07,083 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 06:48:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:07,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:48:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-09 06:48:07,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 06:48:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 06:48:07,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:48:07,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 7 [2018-12-09 06:48:07,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:48:07,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 06:48:07,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 06:48:07,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:48:07,234 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 6 states. [2018-12-09 06:48:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:07,280 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2018-12-09 06:48:07,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 06:48:07,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 06:48:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:07,281 INFO L225 Difference]: With dead ends: 116 [2018-12-09 06:48:07,282 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 06:48:07,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 06:48:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 06:48:07,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-09 06:48:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 06:48:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2018-12-09 06:48:07,290 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 67 [2018-12-09 06:48:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:07,290 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2018-12-09 06:48:07,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 06:48:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2018-12-09 06:48:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 06:48:07,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:07,292 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:07,292 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:07,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:07,293 INFO L82 PathProgramCache]: Analyzing trace with hash -306833031, now seen corresponding path program 2 times [2018-12-09 06:48:07,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:07,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:07,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:07,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:07,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-09 06:48:07,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:07,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 06:48:07,333 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 06:48:07,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 06:48:07,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:07,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:48:07,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 06:48:07,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 06:48:07,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 06:48:07,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:48:07,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:48:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-09 06:48:07,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 06:48:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-09 06:48:07,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 06:48:07,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-09 06:48:07,494 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 06:48:07,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 06:48:07,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 06:48:07,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 06:48:07,495 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 7 states. [2018-12-09 06:48:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:07,551 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2018-12-09 06:48:07,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 06:48:07,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-12-09 06:48:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:07,552 INFO L225 Difference]: With dead ends: 85 [2018-12-09 06:48:07,552 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 06:48:07,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-12-09 06:48:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 06:48:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2018-12-09 06:48:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 06:48:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-12-09 06:48:07,558 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 68 [2018-12-09 06:48:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:07,558 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-12-09 06:48:07,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 06:48:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-12-09 06:48:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 06:48:07,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:07,559 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:07,559 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:07,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:07,559 INFO L82 PathProgramCache]: Analyzing trace with hash 650896746, now seen corresponding path program 1 times [2018-12-09 06:48:07,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:07,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:07,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:48:07,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:07,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-12-09 06:48:07,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:07,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 06:48:07,657 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-12-09 06:48:07,657 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-09 06:48:07,658 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 06:48:07,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 06:48:07,667 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 06:48:07,667 INFO L272 AbstractInterpreter]: Visited 27 different actions 51 times. Never merged. Never widened. Performed 95 root evaluator evaluations with a maximum evaluation depth of 4. Performed 95 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 5 variables. [2018-12-09 06:48:07,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:07,669 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 06:48:07,689 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 48.77% of their original sizes. [2018-12-09 06:48:07,689 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 06:48:07,847 INFO L418 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2018-12-09 06:48:07,847 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 06:48:07,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 06:48:07,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [11] total 32 [2018-12-09 06:48:07,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:48:07,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 06:48:07,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 06:48:07,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-12-09 06:48:07,849 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 23 states. [2018-12-09 06:48:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:08,585 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2018-12-09 06:48:08,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 06:48:08,585 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-12-09 06:48:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:08,586 INFO L225 Difference]: With dead ends: 134 [2018-12-09 06:48:08,586 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 06:48:08,586 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 06:48:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 06:48:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-12-09 06:48:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 06:48:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-12-09 06:48:08,594 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 81 [2018-12-09 06:48:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:08,595 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-12-09 06:48:08,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 06:48:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-12-09 06:48:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 06:48:08,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:08,596 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:08,596 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:08,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2018-12-09 06:48:08,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:08,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:08,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 40 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-09 06:48:08,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:08,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 06:48:08,686 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-12-09 06:48:08,687 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-09 06:48:08,687 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 06:48:08,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 06:48:08,697 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 06:48:08,697 INFO L272 AbstractInterpreter]: Visited 29 different actions 74 times. Never merged. Never widened. Performed 146 root evaluator evaluations with a maximum evaluation depth of 4. Performed 146 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 5 variables. [2018-12-09 06:48:08,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:08,698 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 06:48:08,713 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 48.2% of their original sizes. [2018-12-09 06:48:08,713 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 06:48:08,895 INFO L418 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2018-12-09 06:48:08,896 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 06:48:08,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 06:48:08,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [11] total 38 [2018-12-09 06:48:08,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:48:08,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 06:48:08,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 06:48:08,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=751, Unknown=0, NotChecked=0, Total=812 [2018-12-09 06:48:08,897 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 29 states. [2018-12-09 06:48:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:09,965 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2018-12-09 06:48:09,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 06:48:09,965 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-12-09 06:48:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:09,966 INFO L225 Difference]: With dead ends: 136 [2018-12-09 06:48:09,966 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 06:48:09,967 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 100 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=2093, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 06:48:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 06:48:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-12-09 06:48:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 06:48:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-12-09 06:48:09,975 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 82 [2018-12-09 06:48:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:09,975 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-12-09 06:48:09,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 06:48:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-12-09 06:48:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 06:48:09,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:09,977 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:09,977 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:09,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:09,977 INFO L82 PathProgramCache]: Analyzing trace with hash -46122593, now seen corresponding path program 3 times [2018-12-09 06:48:09,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:09,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:09,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:09,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:09,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-09 06:48:10,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:10,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 06:48:10,048 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 06:48:10,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 06:48:10,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:10,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:48:10,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 06:48:10,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 06:48:10,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 06:48:10,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:48:10,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:48:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-09 06:48:10,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 06:48:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-09 06:48:10,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 06:48:10,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2018-12-09 06:48:10,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 06:48:10,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 06:48:10,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 06:48:10,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-09 06:48:10,307 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 8 states. [2018-12-09 06:48:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:10,372 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2018-12-09 06:48:10,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 06:48:10,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-09 06:48:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:10,373 INFO L225 Difference]: With dead ends: 117 [2018-12-09 06:48:10,373 INFO L226 Difference]: Without dead ends: 110 [2018-12-09 06:48:10,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-09 06:48:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-09 06:48:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-12-09 06:48:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 06:48:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-12-09 06:48:10,378 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 95 [2018-12-09 06:48:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:10,379 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-12-09 06:48:10,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 06:48:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-12-09 06:48:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 06:48:10,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:10,379 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:10,379 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:10,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:10,380 INFO L82 PathProgramCache]: Analyzing trace with hash 235412830, now seen corresponding path program 4 times [2018-12-09 06:48:10,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:10,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:10,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:48:10,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:10,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-12-09 06:48:10,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:10,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 06:48:10,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 06:48:10,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 06:48:10,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:10,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:48:10,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:10,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 06:48:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:10,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:48:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 63 proven. 19 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-12-09 06:48:10,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 06:48:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 63 proven. 20 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-12-09 06:48:10,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 06:48:10,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2018-12-09 06:48:10,722 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 06:48:10,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 06:48:10,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 06:48:10,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-12-09 06:48:10,723 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 13 states. [2018-12-09 06:48:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:10,901 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2018-12-09 06:48:10,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 06:48:10,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-12-09 06:48:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:10,903 INFO L225 Difference]: With dead ends: 172 [2018-12-09 06:48:10,903 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 06:48:10,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 203 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2018-12-09 06:48:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 06:48:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2018-12-09 06:48:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-09 06:48:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2018-12-09 06:48:10,911 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 108 [2018-12-09 06:48:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:10,912 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2018-12-09 06:48:10,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 06:48:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2018-12-09 06:48:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 06:48:10,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:10,913 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:10,914 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:48:10,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:10,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1540036056, now seen corresponding path program 5 times [2018-12-09 06:48:10,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:48:10,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:10,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:10,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:10,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:48:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:48:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:48:10,938 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 06:48:10,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:48:10 BoogieIcfgContainer [2018-12-09 06:48:10,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 06:48:10,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 06:48:10,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 06:48:10,960 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 06:48:10,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:48:05" (3/4) ... [2018-12-09 06:48:10,962 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 06:48:11,002 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9d1ffb57-1d7b-4da8-b4eb-6a92c3e1b650/bin-2019/utaipan/witness.graphml [2018-12-09 06:48:11,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 06:48:11,003 INFO L168 Benchmark]: Toolchain (without parser) took 6133.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 951.3 MB in the beginning and 962.7 MB in the end (delta: -11.4 MB). Peak memory consumption was 303.2 MB. Max. memory is 11.5 GB. [2018-12-09 06:48:11,004 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:48:11,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 123.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 06:48:11,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.45 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:48:11,005 INFO L168 Benchmark]: Boogie Preprocessor took 10.61 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:48:11,005 INFO L168 Benchmark]: RCFGBuilder took 169.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-09 06:48:11,005 INFO L168 Benchmark]: TraceAbstraction took 5771.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 962.7 MB in the end (delta: 154.4 MB). Peak memory consumption was 330.0 MB. Max. memory is 11.5 GB. [2018-12-09 06:48:11,006 INFO L168 Benchmark]: Witness Printer took 42.87 ms. Allocated memory is still 1.3 GB. Free memory is still 962.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:48:11,007 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 123.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.45 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.61 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 169.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5771.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 962.7 MB in the end (delta: 154.4 MB). Peak memory consumption was 330.0 MB. Max. memory is 11.5 GB. * Witness Printer took 42.87 ms. Allocated memory is still 1.3 GB. Free memory is still 962.7 MB. 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 = 5; VAL [x=5] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L37] int result = fibo1(x); [L38] COND TRUE result == 5 VAL [result=5, x=5] [L39] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 5.7s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 388 SDtfs, 379 SDslu, 2966 SDs, 0 SdLazy, 1338 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1173 GetRequests, 950 SyntacticMatches, 31 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.8342326139088725 AbsIntWeakeningRatio, 0.5683453237410072 AbsIntAvgWeakeningVarsNumRemoved, 0.35611510791366907 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 51 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1199 NumberOfCodeBlocks, 1164 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1458 ConstructedInterpolants, 0 QuantifiedInterpolants, 176654 SizeOfPredicates, 18 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 2012/2278 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...