./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_4_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_222d399a-34d1-4f39-816a-329ccaa77774/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_4_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/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 7a7b79fb8a331a00295fb9ddfb653e17bda3c30d
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
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-03 02:12:29,555 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-12-03 02:12:29,556 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-12-03 02:12:29,565 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-12-03 02:12:29,565 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-12-03 02:12:29,566 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-12-03 02:12:29,567 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-12-03 02:12:29,568 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-12-03 02:12:29,570 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-12-03 02:12:29,570 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-12-03 02:12:29,571 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-12-03 02:12:29,571 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-12-03 02:12:29,572 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-12-03 02:12:29,573 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-12-03 02:12:29,574 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-12-03 02:12:29,574 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-12-03 02:12:29,575 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-12-03 02:12:29,576 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-12-03 02:12:29,578 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-12-03 02:12:29,579 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-12-03 02:12:29,580 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-12-03 02:12:29,581 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-12-03 02:12:29,582 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-12-03 02:12:29,583 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-12-03 02:12:29,583 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-12-03 02:12:29,584 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-12-03 02:12:29,584 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-12-03 02:12:29,585 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-12-03 02:12:29,586 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-12-03 02:12:29,586 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-12-03 02:12:29,586 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-12-03 02:12:29,587 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-12-03 02:12:29,587 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-12-03 02:12:29,587 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-12-03 02:12:29,588 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-12-03 02:12:29,588 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-12-03 02:12:29,589 INFO  L98         SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf
[2018-12-03 02:12:29,599 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-12-03 02:12:29,599 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-12-03 02:12:29,600 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-12-03 02:12:29,600 INFO  L133        SettingsManager]:  * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS
[2018-12-03 02:12:29,600 INFO  L133        SettingsManager]:  * User list type=DISABLED
[2018-12-03 02:12:29,600 INFO  L131        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-12-03 02:12:29,600 INFO  L133        SettingsManager]:  * Explicit value domain=true
[2018-12-03 02:12:29,600 INFO  L133        SettingsManager]:  * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2018-12-03 02:12:29,600 INFO  L133        SettingsManager]:  * Octagon Domain=false
[2018-12-03 02:12:29,601 INFO  L133        SettingsManager]:  * Abstract domain=CompoundDomain
[2018-12-03 02:12:29,601 INFO  L133        SettingsManager]:  * Check feasibility of abstract posts with an SMT solver=true
[2018-12-03 02:12:29,601 INFO  L133        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2018-12-03 02:12:29,601 INFO  L133        SettingsManager]:  * Interval Domain=false
[2018-12-03 02:12:29,601 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-12-03 02:12:29,602 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-12-03 02:12:29,602 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-12-03 02:12:29,602 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-12-03 02:12:29,602 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-12-03 02:12:29,602 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-12-03 02:12:29,602 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-12-03 02:12:29,602 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-12-03 02:12:29,603 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-12-03 02:12:29,603 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-12-03 02:12:29,603 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-12-03 02:12:29,603 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-12-03 02:12:29,603 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-12-03 02:12:29,603 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-12-03 02:12:29,603 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-12-03 02:12:29,603 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-12-03 02:12:29,603 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-12-03 02:12:29,604 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-12-03 02:12:29,604 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-12-03 02:12:29,604 INFO  L133        SettingsManager]:  * Trace refinement strategy=TAIPAN
[2018-12-03 02:12:29,604 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-12-03 02:12:29,604 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-12-03 02:12:29,604 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-12-03 02:12:29,604 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_222d399a-34d1-4f39-816a-329ccaa77774/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 -> 7a7b79fb8a331a00295fb9ddfb653e17bda3c30d
[2018-12-03 02:12:29,623 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-12-03 02:12:29,630 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-12-03 02:12:29,632 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-12-03 02:12:29,633 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-12-03 02:12:29,633 INFO  L276        PluginConnector]: CDTParser initialized
[2018-12-03 02:12:29,634 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_4_false-unreach-call_true-termination.c
[2018-12-03 02:12:29,667 INFO  L221              CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/bin-2019/utaipan/data/f31ca14b7/19b530625f9c4ee2a74488c89c4494dc/FLAG563aeafeb
[2018-12-03 02:12:30,058 INFO  L307              CDTParser]: Found 1 translation units.
[2018-12-03 02:12:30,059 INFO  L161              CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/sv-benchmarks/c/recursive-simple/fibo_2calls_4_false-unreach-call_true-termination.c
[2018-12-03 02:12:30,062 INFO  L355              CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/bin-2019/utaipan/data/f31ca14b7/19b530625f9c4ee2a74488c89c4494dc/FLAG563aeafeb
[2018-12-03 02:12:30,494 INFO  L363              CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/bin-2019/utaipan/data/f31ca14b7/19b530625f9c4ee2a74488c89c4494dc
[2018-12-03 02:12:30,496 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-12-03 02:12:30,497 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-12-03 02:12:30,498 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-12-03 02:12:30,498 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-12-03 02:12:30,500 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-12-03 02:12:30,500 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:12:30" (1/1) ...
[2018-12-03 02:12:30,502 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672351b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30, skipping insertion in model container
[2018-12-03 02:12:30,502 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:12:30" (1/1) ...
[2018-12-03 02:12:30,507 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-12-03 02:12:30,517 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-12-03 02:12:30,600 INFO  L203          PostProcessor]: Analyzing one entry point: main
[2018-12-03 02:12:30,602 INFO  L191         MainTranslator]: Completed pre-run
[2018-12-03 02:12:30,611 INFO  L203          PostProcessor]: Analyzing one entry point: main
[2018-12-03 02:12:30,619 INFO  L195         MainTranslator]: Completed translation
[2018-12-03 02:12:30,619 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30 WrapperNode
[2018-12-03 02:12:30,619 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-12-03 02:12:30,620 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-12-03 02:12:30,620 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-12-03 02:12:30,620 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-12-03 02:12:30,625 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30" (1/1) ...
[2018-12-03 02:12:30,627 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30" (1/1) ...
[2018-12-03 02:12:30,631 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-12-03 02:12:30,631 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-12-03 02:12:30,631 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-12-03 02:12:30,632 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-12-03 02:12:30,637 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30" (1/1) ...
[2018-12-03 02:12:30,637 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30" (1/1) ...
[2018-12-03 02:12:30,637 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30" (1/1) ...
[2018-12-03 02:12:30,638 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30" (1/1) ...
[2018-12-03 02:12:30,640 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30" (1/1) ...
[2018-12-03 02:12:30,641 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30" (1/1) ...
[2018-12-03 02:12:30,641 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30" (1/1) ...
[2018-12-03 02:12:30,642 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-12-03 02:12:30,643 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-12-03 02:12:30,643 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-12-03 02:12:30,643 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-12-03 02:12:30,643 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/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-03 02:12:30,703 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-12-03 02:12:30,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-12-03 02:12:30,704 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-12-03 02:12:30,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-12-03 02:12:30,704 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-12-03 02:12:30,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-12-03 02:12:30,704 INFO  L130     BoogieDeclarations]: Found specification of procedure fibo2
[2018-12-03 02:12:30,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure fibo2
[2018-12-03 02:12:30,704 INFO  L130     BoogieDeclarations]: Found specification of procedure fibo1
[2018-12-03 02:12:30,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure fibo1
[2018-12-03 02:12:30,797 INFO  L275             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-12-03 02:12:30,797 INFO  L280             CfgBuilder]: Removed 0 assue(true) statements.
[2018-12-03 02:12:30,797 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:12:30 BoogieIcfgContainer
[2018-12-03 02:12:30,797 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-12-03 02:12:30,798 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-12-03 02:12:30,798 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-12-03 02:12:30,800 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-12-03 02:12:30,800 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:12:30" (1/3) ...
[2018-12-03 02:12:30,801 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440bfaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:12:30, skipping insertion in model container
[2018-12-03 02:12:30,801 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:12:30" (2/3) ...
[2018-12-03 02:12:30,801 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440bfaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:12:30, skipping insertion in model container
[2018-12-03 02:12:30,801 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:12:30" (3/3) ...
[2018-12-03 02:12:30,802 INFO  L112   eAbstractionObserver]: Analyzing ICFG fibo_2calls_4_false-unreach-call_true-termination.c
[2018-12-03 02:12:30,808 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-12-03 02:12:30,812 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-12-03 02:12:30,822 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-12-03 02:12:30,840 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-12-03 02:12:30,841 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-12-03 02:12:30,841 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-12-03 02:12:30,841 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-12-03 02:12:30,841 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-12-03 02:12:30,841 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-12-03 02:12:30,841 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-12-03 02:12:30,841 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-12-03 02:12:30,852 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states.
[2018-12-03 02:12:30,855 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-12-03 02:12:30,855 INFO  L394         BasicCegarLoop]: Found error trace
[2018-12-03 02:12:30,856 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-12-03 02:12:30,857 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-12-03 02:12:30,860 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-12-03 02:12:30,861 INFO  L82        PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times
[2018-12-03 02:12:30,862 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-12-03 02:12:30,891 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:30,891 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-12-03 02:12:30,892 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:30,892 INFO  L286   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-12-03 02:12:30,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-03 02:12:30,968 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-03 02:12:30,970 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-12-03 02:12:30,970 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-12-03 02:12:30,970 INFO  L256   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-12-03 02:12:30,972 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-12-03 02:12:30,980 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-12-03 02:12:30,980 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-12-03 02:12:30,982 INFO  L87              Difference]: Start difference. First operand 33 states. Second operand 5 states.
[2018-12-03 02:12:31,032 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-03 02:12:31,032 INFO  L93              Difference]: Finished difference Result 44 states and 53 transitions.
[2018-12-03 02:12:31,032 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-12-03 02:12:31,033 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2018-12-03 02:12:31,034 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-12-03 02:12:31,039 INFO  L225             Difference]: With dead ends: 44
[2018-12-03 02:12:31,039 INFO  L226             Difference]: Without dead ends: 30
[2018-12-03 02:12:31,041 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-03 02:12:31,051 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2018-12-03 02:12:31,066 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2018-12-03 02:12:31,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2018-12-03 02:12:31,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions.
[2018-12-03 02:12:31,068 INFO  L78                 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13
[2018-12-03 02:12:31,068 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-12-03 02:12:31,069 INFO  L480      AbstractCegarLoop]: Abstraction has 30 states and 37 transitions.
[2018-12-03 02:12:31,069 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-12-03 02:12:31,069 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions.
[2018-12-03 02:12:31,070 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-12-03 02:12:31,070 INFO  L394         BasicCegarLoop]: Found error trace
[2018-12-03 02:12:31,070 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-12-03 02:12:31,070 INFO  L423      AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-12-03 02:12:31,070 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-12-03 02:12:31,070 INFO  L82        PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times
[2018-12-03 02:12:31,070 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-12-03 02:12:31,071 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:31,071 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-12-03 02:12:31,071 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:31,071 INFO  L286   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-12-03 02:12:31,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-03 02:12:31,097 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-03 02:12:31,098 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-12-03 02:12:31,098 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-12-03 02:12:31,098 INFO  L256   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-12-03 02:12:31,099 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-12-03 02:12:31,100 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-12-03 02:12:31,100 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-12-03 02:12:31,100 INFO  L87              Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states.
[2018-12-03 02:12:31,143 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-03 02:12:31,143 INFO  L93              Difference]: Finished difference Result 36 states and 44 transitions.
[2018-12-03 02:12:31,144 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-12-03 02:12:31,144 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2018-12-03 02:12:31,144 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-12-03 02:12:31,145 INFO  L225             Difference]: With dead ends: 36
[2018-12-03 02:12:31,145 INFO  L226             Difference]: Without dead ends: 32
[2018-12-03 02:12:31,146 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-03 02:12:31,146 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2018-12-03 02:12:31,150 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30.
[2018-12-03 02:12:31,150 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2018-12-03 02:12:31,151 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions.
[2018-12-03 02:12:31,151 INFO  L78                 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14
[2018-12-03 02:12:31,152 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-12-03 02:12:31,152 INFO  L480      AbstractCegarLoop]: Abstraction has 30 states and 37 transitions.
[2018-12-03 02:12:31,152 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-12-03 02:12:31,152 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions.
[2018-12-03 02:12:31,153 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-12-03 02:12:31,153 INFO  L394         BasicCegarLoop]: Found error trace
[2018-12-03 02:12:31,153 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-03 02:12:31,153 INFO  L423      AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-12-03 02:12:31,153 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-12-03 02:12:31,154 INFO  L82        PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times
[2018-12-03 02:12:31,154 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-12-03 02:12:31,154 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:31,154 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-12-03 02:12:31,155 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:31,155 INFO  L286   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-12-03 02:12:31,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-03 02:12:31,204 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-03 02:12:31,204 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-12-03 02:12:31,204 INFO  L192   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2018-12-03 02:12:31,205 INFO  L203      CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: 
[2018-12-03 02:12:31,206 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-03 02:12:31,225 INFO  L148    AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain]
[2018-12-03 02:12:31,225 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2)
[2018-12-03 02:12:31,286 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2018-12-03 02:12:31,287 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-03 02:12:31,297 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-12-03 02:12:31,298 INFO  L401   sIntCurrentIteration]: Generating AbsInt predicates
[2018-12-03 02:12:31,324 INFO  L227   lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes.
[2018-12-03 02:12:31,324 INFO  L416   sIntCurrentIteration]: Unifying AI predicates
[2018-12-03 02:12:31,336 INFO  L418   sIntCurrentIteration]: We unified 25 AI predicates to 25
[2018-12-03 02:12:31,336 INFO  L427   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2018-12-03 02:12:31,337 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-12-03 02:12:31,337 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11
[2018-12-03 02:12:31,337 INFO  L256   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-12-03 02:12:31,337 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-12-03 02:12:31,337 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-12-03 02:12:31,337 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-12-03 02:12:31,338 INFO  L87              Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states.
[2018-12-03 02:12:31,445 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-03 02:12:31,445 INFO  L93              Difference]: Finished difference Result 72 states and 95 transitions.
[2018-12-03 02:12:31,445 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2018-12-03 02:12:31,445 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 26
[2018-12-03 02:12:31,446 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-12-03 02:12:31,446 INFO  L225             Difference]: With dead ends: 72
[2018-12-03 02:12:31,446 INFO  L226             Difference]: Without dead ends: 48
[2018-12-03 02:12:31,447 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-03 02:12:31,447 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-12-03 02:12:31,451 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46.
[2018-12-03 02:12:31,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 46 states.
[2018-12-03 02:12:31,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions.
[2018-12-03 02:12:31,452 INFO  L78                 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26
[2018-12-03 02:12:31,452 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-12-03 02:12:31,452 INFO  L480      AbstractCegarLoop]: Abstraction has 46 states and 54 transitions.
[2018-12-03 02:12:31,453 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-12-03 02:12:31,453 INFO  L276                IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions.
[2018-12-03 02:12:31,454 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-12-03 02:12:31,454 INFO  L394         BasicCegarLoop]: Found error trace
[2018-12-03 02:12:31,454 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-03 02:12:31,454 INFO  L423      AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-12-03 02:12:31,454 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-12-03 02:12:31,454 INFO  L82        PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times
[2018-12-03 02:12:31,454 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-12-03 02:12:31,455 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:31,455 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-12-03 02:12:31,455 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:31,455 INFO  L286   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-12-03 02:12:31,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-03 02:12:31,487 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-03 02:12:31,488 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-12-03 02:12:31,488 INFO  L192   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2018-12-03 02:12:31,488 INFO  L203      CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: 
[2018-12-03 02:12:31,488 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-03 02:12:31,489 INFO  L148    AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain]
[2018-12-03 02:12:31,489 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2)
[2018-12-03 02:12:31,497 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2018-12-03 02:12:31,497 INFO  L272    AbstractInterpreter]: Visited 16 different actions 25 times. Never merged. Never widened. Performed 41 root evaluator evaluations with a maximum evaluation depth of 3. Performed 41 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables.
[2018-12-03 02:12:31,498 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-12-03 02:12:31,498 INFO  L401   sIntCurrentIteration]: Generating AbsInt predicates
[2018-12-03 02:12:31,510 INFO  L227   lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes.
[2018-12-03 02:12:31,510 INFO  L416   sIntCurrentIteration]: Unifying AI predicates
[2018-12-03 02:12:31,527 INFO  L418   sIntCurrentIteration]: We unified 38 AI predicates to 38
[2018-12-03 02:12:31,527 INFO  L427   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2018-12-03 02:12:31,527 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-12-03 02:12:31,528 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13
[2018-12-03 02:12:31,528 INFO  L256   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-12-03 02:12:31,528 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-12-03 02:12:31,528 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-12-03 02:12:31,528 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-12-03 02:12:31,528 INFO  L87              Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states.
[2018-12-03 02:12:31,686 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-03 02:12:31,686 INFO  L93              Difference]: Finished difference Result 87 states and 106 transitions.
[2018-12-03 02:12:31,686 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2018-12-03 02:12:31,686 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 39
[2018-12-03 02:12:31,686 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-12-03 02:12:31,687 INFO  L225             Difference]: With dead ends: 87
[2018-12-03 02:12:31,687 INFO  L226             Difference]: Without dead ends: 55
[2018-12-03 02:12:31,687 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-03 02:12:31,687 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2018-12-03 02:12:31,691 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55.
[2018-12-03 02:12:31,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-12-03 02:12:31,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions.
[2018-12-03 02:12:31,692 INFO  L78                 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39
[2018-12-03 02:12:31,693 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-12-03 02:12:31,693 INFO  L480      AbstractCegarLoop]: Abstraction has 55 states and 64 transitions.
[2018-12-03 02:12:31,693 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-12-03 02:12:31,693 INFO  L276                IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions.
[2018-12-03 02:12:31,694 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-12-03 02:12:31,694 INFO  L394         BasicCegarLoop]: Found error trace
[2018-12-03 02:12:31,694 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-03 02:12:31,694 INFO  L423      AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-12-03 02:12:31,694 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-12-03 02:12:31,694 INFO  L82        PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times
[2018-12-03 02:12:31,694 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-12-03 02:12:31,695 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:31,695 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-12-03 02:12:31,695 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:31,695 INFO  L286   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-12-03 02:12:31,703 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-03 02:12:31,743 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-03 02:12:31,743 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-12-03 02:12:31,743 INFO  L192   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2018-12-03 02:12:31,743 INFO  L187      CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program
[2018-12-03 02:12:31,744 INFO  L422   seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints
[2018-12-03 02:12:31,744 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-12-03 02:12:31,744 INFO  L192   anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/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-03 02:12:31,751 INFO  L103   rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-12-03 02:12:31,751 INFO  L286   anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)
[2018-12-03 02:12:31,766 INFO  L249   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2018-12-03 02:12:31,766 INFO  L250   tOrderPrioritization]: Conjunction of SSA is unsat
[2018-12-03 02:12:31,771 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-12-03 02:12:31,830 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-03 02:12:31,830 INFO  L316         TraceCheckSpWp]: Computing backward predicates...
[2018-12-03 02:12:32,038 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-03 02:12:32,052 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2018-12-03 02:12:32,052 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14
[2018-12-03 02:12:32,052 INFO  L249   anRefinementStrategy]: Using the first two imperfect interpolant sequences
[2018-12-03 02:12:32,053 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-12-03 02:12:32,053 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-12-03 02:12:32,053 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182
[2018-12-03 02:12:32,053 INFO  L87              Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states.
[2018-12-03 02:12:32,209 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-03 02:12:32,209 INFO  L93              Difference]: Finished difference Result 121 states and 177 transitions.
[2018-12-03 02:12:32,209 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2018-12-03 02:12:32,209 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 52
[2018-12-03 02:12:32,210 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-12-03 02:12:32,211 INFO  L225             Difference]: With dead ends: 121
[2018-12-03 02:12:32,211 INFO  L226             Difference]: Without dead ends: 76
[2018-12-03 02:12:32,212 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420
[2018-12-03 02:12:32,212 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2018-12-03 02:12:32,217 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59.
[2018-12-03 02:12:32,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2018-12-03 02:12:32,218 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions.
[2018-12-03 02:12:32,218 INFO  L78                 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52
[2018-12-03 02:12:32,218 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-12-03 02:12:32,218 INFO  L480      AbstractCegarLoop]: Abstraction has 59 states and 70 transitions.
[2018-12-03 02:12:32,218 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-12-03 02:12:32,218 INFO  L276                IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions.
[2018-12-03 02:12:32,219 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-12-03 02:12:32,219 INFO  L394         BasicCegarLoop]: Found error trace
[2018-12-03 02:12:32,219 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-03 02:12:32,219 INFO  L423      AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-12-03 02:12:32,219 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-12-03 02:12:32,219 INFO  L82        PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times
[2018-12-03 02:12:32,219 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-12-03 02:12:32,220 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:32,220 INFO  L101   rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-12-03 02:12:32,220 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:32,220 INFO  L286   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-12-03 02:12:32,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-03 02:12:32,263 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-03 02:12:32,263 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-12-03 02:12:32,263 INFO  L192   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2018-12-03 02:12:32,263 INFO  L203      CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: 
[2018-12-03 02:12:32,263 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-03 02:12:32,265 INFO  L148    AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain]
[2018-12-03 02:12:32,265 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2)
[2018-12-03 02:12:32,285 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2018-12-03 02:12:32,285 INFO  L272    AbstractInterpreter]: Visited 29 different actions 68 times. Never merged. Never widened. Performed 128 root evaluator evaluations with a maximum evaluation depth of 4. Performed 128 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 5 variables.
[2018-12-03 02:12:32,286 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-12-03 02:12:32,286 INFO  L401   sIntCurrentIteration]: Generating AbsInt predicates
[2018-12-03 02:12:32,318 INFO  L227   lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 48.04% of their original sizes.
[2018-12-03 02:12:32,318 INFO  L416   sIntCurrentIteration]: Unifying AI predicates
[2018-12-03 02:12:32,543 INFO  L418   sIntCurrentIteration]: We unified 54 AI predicates to 54
[2018-12-03 02:12:32,543 INFO  L427   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2018-12-03 02:12:32,543 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-12-03 02:12:32,543 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [7] total 32
[2018-12-03 02:12:32,543 INFO  L256   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-12-03 02:12:32,544 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-12-03 02:12:32,544 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-12-03 02:12:32,544 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702
[2018-12-03 02:12:32,544 INFO  L87              Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 27 states.
[2018-12-03 02:12:33,497 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-03 02:12:33,498 INFO  L93              Difference]: Finished difference Result 127 states and 162 transitions.
[2018-12-03 02:12:33,498 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2018-12-03 02:12:33,498 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states. Word has length 55
[2018-12-03 02:12:33,498 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-12-03 02:12:33,499 INFO  L225             Difference]: With dead ends: 127
[2018-12-03 02:12:33,499 INFO  L226             Difference]: Without dead ends: 86
[2018-12-03 02:12:33,500 INFO  L631         BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=1825, Unknown=0, NotChecked=0, Total=1980
[2018-12-03 02:12:33,500 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2018-12-03 02:12:33,505 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80.
[2018-12-03 02:12:33,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 80 states.
[2018-12-03 02:12:33,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions.
[2018-12-03 02:12:33,506 INFO  L78                 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 55
[2018-12-03 02:12:33,506 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-12-03 02:12:33,506 INFO  L480      AbstractCegarLoop]: Abstraction has 80 states and 87 transitions.
[2018-12-03 02:12:33,506 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-12-03 02:12:33,507 INFO  L276                IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions.
[2018-12-03 02:12:33,507 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-12-03 02:12:33,507 INFO  L394         BasicCegarLoop]: Found error trace
[2018-12-03 02:12:33,508 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-03 02:12:33,508 INFO  L423      AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-12-03 02:12:33,508 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-12-03 02:12:33,508 INFO  L82        PathProgramCache]: Analyzing trace with hash -1156896337, now seen corresponding path program 1 times
[2018-12-03 02:12:33,508 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-12-03 02:12:33,508 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:33,509 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-12-03 02:12:33,509 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-03 02:12:33,509 INFO  L286   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-12-03 02:12:33,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-12-03 02:12:33,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-12-03 02:12:33,534 INFO  L469         BasicCegarLoop]: Counterexample might be feasible
[2018-12-03 02:12:33,549 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:12:33 BoogieIcfgContainer
[2018-12-03 02:12:33,549 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-12-03 02:12:33,549 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-12-03 02:12:33,549 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-12-03 02:12:33,549 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-12-03 02:12:33,550 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:12:30" (3/4) ...
[2018-12-03 02:12:33,551 INFO  L138         WitnessPrinter]: Generating witness for reachability counterexample
[2018-12-03 02:12:33,579 INFO  L145         WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_222d399a-34d1-4f39-816a-329ccaa77774/bin-2019/utaipan/witness.graphml
[2018-12-03 02:12:33,579 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-12-03 02:12:33,580 INFO  L168              Benchmark]: Toolchain (without parser) took 3083.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.7 MB). Free memory was 960.3 MB in the beginning and 867.4 MB in the end (delta: 92.9 MB). Peak memory consumption was 280.6 MB. Max. memory is 11.5 GB.
[2018-12-03 02:12:33,580 INFO  L168              Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-12-03 02:12:33,581 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 121.96 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2018-12-03 02:12:33,581 INFO  L168              Benchmark]: Boogie Procedure Inliner took 11.53 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-12-03 02:12:33,581 INFO  L168              Benchmark]: Boogie Preprocessor took 10.92 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-12-03 02:12:33,581 INFO  L168              Benchmark]: RCFGBuilder took 154.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -125.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB.
[2018-12-03 02:12:33,581 INFO  L168              Benchmark]: TraceAbstraction took 2751.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 875.5 MB in the end (delta: 199.4 MB). Peak memory consumption was 289.1 MB. Max. memory is 11.5 GB.
[2018-12-03 02:12:33,582 INFO  L168              Benchmark]: Witness Printer took 30.03 ms. Allocated memory is still 1.2 GB. Free memory was 875.5 MB in the beginning and 867.4 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB.
[2018-12-03 02:12:33,583 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * CACSL2BoogieTranslator took 121.96 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.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 11.53 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 10.92 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * RCFGBuilder took 154.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -125.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB.
 * TraceAbstraction took 2751.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 875.5 MB in the end (delta: 199.4 MB). Peak memory consumption was 289.1 MB. Max. memory is 11.5 GB.
 * Witness Printer took 30.03 ms. Allocated memory is still 1.2 GB. Free memory was 875.5 MB in the beginning and 867.4 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L36]              int x = 4;
       VAL         [x=4]
[L37]  CALL, EXPR  fibo1(x)
       VAL         [\old(n)=4]
[L8]   COND FALSE  !(n < 1)
       VAL         [\old(n)=4, n=4]
[L10]  COND FALSE  !(n == 1)
       VAL         [\old(n)=4, n=4]
[L13]  CALL, EXPR  fibo2(n-1)
       VAL         [\old(n)=3]
[L18]  COND FALSE  !(n < 1)
       VAL         [\old(n)=3, n=3]
[L20]  COND FALSE  !(n == 1)
       VAL         [\old(n)=3, n=3]
[L23]  CALL, EXPR  fibo1(n-1)
       VAL         [\old(n)=2]
[L8]   COND FALSE  !(n < 1)
       VAL         [\old(n)=2, n=2]
[L10]  COND FALSE  !(n == 1)
       VAL         [\old(n)=2, n=2]
[L13]  CALL, EXPR  fibo2(n-1)
       VAL         [\old(n)=1]
[L18]  COND FALSE  !(n < 1)
       VAL         [\old(n)=1, n=1]
[L20]  COND TRUE   n == 1
[L21]              return 1;
       VAL         [\old(n)=1, \result=1, n=1]
[L13]  RET, EXPR   fibo2(n-1)
       VAL         [\old(n)=2, fibo2(n-1)=1, n=2]
[L13]  CALL, EXPR  fibo2(n-2)
       VAL         [\old(n)=0]
[L18]  COND TRUE   n < 1
[L19]              return 0;
       VAL         [\old(n)=0, \result=0, n=0]
[L13]  RET, EXPR   fibo2(n-2)
       VAL         [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2]
[L13]              return fibo2(n-1) + fibo2(n-2);
[L23]  RET, EXPR   fibo1(n-1)
       VAL         [\old(n)=3, fibo1(n-1)=1, n=3]
[L23]  CALL, EXPR  fibo1(n-2)
       VAL         [\old(n)=1]
[L8]   COND FALSE  !(n < 1)
       VAL         [\old(n)=1, n=1]
[L10]  COND TRUE   n == 1
[L11]              return 1;
       VAL         [\old(n)=1, \result=1, n=1]
[L23]  RET, EXPR   fibo1(n-2)
       VAL         [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3]
[L23]              return fibo1(n-1) + fibo1(n-2);
[L13]  RET, EXPR   fibo2(n-1)
       VAL         [\old(n)=4, fibo2(n-1)=2, n=4]
[L13]  CALL, EXPR  fibo2(n-2)
       VAL         [\old(n)=2]
[L18]  COND FALSE  !(n < 1)
       VAL         [\old(n)=2, n=2]
[L20]  COND FALSE  !(n == 1)
       VAL         [\old(n)=2, n=2]
[L23]  CALL, EXPR  fibo1(n-1)
       VAL         [\old(n)=1]
[L8]   COND FALSE  !(n < 1)
       VAL         [\old(n)=1, n=1]
[L10]  COND TRUE   n == 1
[L11]              return 1;
       VAL         [\old(n)=1, \result=1, n=1]
[L23]  RET, EXPR   fibo1(n-1)
       VAL         [\old(n)=2, fibo1(n-1)=1, n=2]
[L23]  CALL, EXPR  fibo1(n-2)
       VAL         [\old(n)=0]
[L8]   COND TRUE   n < 1
[L9]               return 0;
       VAL         [\old(n)=0, \result=0, n=0]
[L23]  RET, EXPR   fibo1(n-2)
       VAL         [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2]
[L23]              return fibo1(n-1) + fibo1(n-2);
[L13]  RET, EXPR   fibo2(n-2)
       VAL         [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4]
[L13]              return fibo2(n-1) + fibo2(n-2);
[L37]  RET, EXPR   fibo1(x)
       VAL         [fibo1(x)=3, x=4]
[L37]              int result = fibo1(x);
[L38]  COND TRUE   result == 3
       VAL         [result=3, x=4]
[L39]              __VERIFIER_error()
       VAL         [result=3, x=4]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 2.7s OverallTime, 7 OverallIterations, 5 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 194 SDtfs, 166 SDslu, 1409 SDs, 0 SdLazy, 510 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 271 GetRequests, 176 SyntacticMatches, 8 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.7934472934472937 AbsIntWeakeningRatio, 0.5641025641025641 AbsIntAvgWeakeningVarsNumRemoved, 0.452991452991453 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 21787 SizeOfPredicates, 4 NumberOfNonLiveVariables, 118 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 145/189 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...