java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_5-2.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-112bae1
[2019-09-10 03:05:51,838 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-09-10 03:05:51,840 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-09-10 03:05:51,852 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-09-10 03:05:51,852 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-09-10 03:05:51,853 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-09-10 03:05:51,855 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-09-10 03:05:51,857 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-09-10 03:05:51,858 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-09-10 03:05:51,859 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-09-10 03:05:51,860 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-09-10 03:05:51,861 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-09-10 03:05:51,861 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-09-10 03:05:51,862 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-09-10 03:05:51,863 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-09-10 03:05:51,864 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-09-10 03:05:51,865 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-09-10 03:05:51,868 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-09-10 03:05:51,870 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-09-10 03:05:51,872 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-09-10 03:05:51,873 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-09-10 03:05:51,874 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-09-10 03:05:51,875 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-09-10 03:05:51,876 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-09-10 03:05:51,878 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-09-10 03:05:51,878 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-09-10 03:05:51,878 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-09-10 03:05:51,879 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-09-10 03:05:51,879 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-09-10 03:05:51,880 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-09-10 03:05:51,880 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-09-10 03:05:51,881 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-09-10 03:05:51,882 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-09-10 03:05:51,883 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-09-10 03:05:51,884 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-09-10 03:05:51,884 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-09-10 03:05:51,885 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-09-10 03:05:51,885 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-09-10 03:05:51,885 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-09-10 03:05:51,886 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-09-10 03:05:51,887 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-09-10 03:05:51,887 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf
[2019-09-10 03:05:51,902 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-09-10 03:05:51,902 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-09-10 03:05:51,902 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2019-09-10 03:05:51,903 INFO  L138        SettingsManager]:  * Log level for plugins=info
[2019-09-10 03:05:51,903 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2019-09-10 03:05:51,903 INFO  L138        SettingsManager]:  * User list type=DISABLED
[2019-09-10 03:05:51,904 INFO  L138        SettingsManager]:  * Ignore calls to and inside polymorphic procedures=false
[2019-09-10 03:05:51,904 INFO  L138        SettingsManager]:  * Ignore calls to recursive procedures=false
[2019-09-10 03:05:51,904 INFO  L136        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2019-09-10 03:05:51,904 INFO  L138        SettingsManager]:  * Abstract domain=IntervalDomain
[2019-09-10 03:05:51,905 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-09-10 03:05:51,905 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-09-10 03:05:51,905 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-09-10 03:05:51,906 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-09-10 03:05:51,906 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-09-10 03:05:51,906 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-09-10 03:05:51,906 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-09-10 03:05:51,906 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-09-10 03:05:51,907 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-09-10 03:05:51,907 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-09-10 03:05:51,907 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-09-10 03:05:51,907 INFO  L138        SettingsManager]:  * Remove goto edges from RCFG=true
[2019-09-10 03:05:51,907 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-09-10 03:05:51,908 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-09-10 03:05:51,908 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-09-10 03:05:51,908 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-09-10 03:05:51,908 INFO  L138        SettingsManager]:  * Trace refinement strategy=TAIPAN
[2019-09-10 03:05:51,908 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-09-10 03:05:51,909 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-09-10 03:05:51,909 INFO  L138        SettingsManager]:  * Abstract interpretation Mode=USE_PREDICATES
[2019-09-10 03:05:51,939 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-09-10 03:05:51,955 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-09-10 03:05:51,959 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-09-10 03:05:51,960 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-09-10 03:05:51,961 INFO  L275        PluginConnector]: CDTParser initialized
[2019-09-10 03:05:51,962 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_5-2.c
[2019-09-10 03:05:52,032 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd47996c2/eae81369d13b43dda8582e40134fdbcb/FLAG950a7be0b
[2019-09-10 03:05:52,437 INFO  L306              CDTParser]: Found 1 translation units.
[2019-09-10 03:05:52,438 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_5-2.c
[2019-09-10 03:05:52,444 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd47996c2/eae81369d13b43dda8582e40134fdbcb/FLAG950a7be0b
[2019-09-10 03:05:52,818 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd47996c2/eae81369d13b43dda8582e40134fdbcb
[2019-09-10 03:05:52,827 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-09-10 03:05:52,828 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-09-10 03:05:52,835 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-09-10 03:05:52,835 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-09-10 03:05:52,838 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-09-10 03:05:52,839 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:05:52" (1/1) ...
[2019-09-10 03:05:52,842 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9b58fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:52, skipping insertion in model container
[2019-09-10 03:05:52,842 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:05:52" (1/1) ...
[2019-09-10 03:05:52,850 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-09-10 03:05:52,865 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-09-10 03:05:53,066 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-10 03:05:53,074 INFO  L188         MainTranslator]: Completed pre-run
[2019-09-10 03:05:53,097 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-10 03:05:53,112 INFO  L192         MainTranslator]: Completed translation
[2019-09-10 03:05:53,112 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:53 WrapperNode
[2019-09-10 03:05:53,113 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-09-10 03:05:53,114 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-09-10 03:05:53,114 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-09-10 03:05:53,114 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-09-10 03:05:53,129 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:53" (1/1) ...
[2019-09-10 03:05:53,131 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:53" (1/1) ...
[2019-09-10 03:05:53,141 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:53" (1/1) ...
[2019-09-10 03:05:53,142 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:53" (1/1) ...
[2019-09-10 03:05:53,147 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:53" (1/1) ...
[2019-09-10 03:05:53,149 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:53" (1/1) ...
[2019-09-10 03:05:53,150 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:53" (1/1) ...
[2019-09-10 03:05:53,151 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-09-10 03:05:53,152 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-09-10 03:05:53,152 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-09-10 03:05:53,152 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-09-10 03:05:53,153 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:53" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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
[2019-09-10 03:05:53,318 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-09-10 03:05:53,318 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-09-10 03:05:53,318 INFO  L138     BoogieDeclarations]: Found implementation of procedure fibo
[2019-09-10 03:05:53,318 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-09-10 03:05:53,318 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-09-10 03:05:53,319 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-09-10 03:05:53,319 INFO  L130     BoogieDeclarations]: Found specification of procedure fibo
[2019-09-10 03:05:53,319 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-09-10 03:05:53,319 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-09-10 03:05:53,319 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-09-10 03:05:53,517 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-09-10 03:05:53,518 INFO  L283             CfgBuilder]: Removed 0 assume(true) statements.
[2019-09-10 03:05:53,519 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:05:53 BoogieIcfgContainer
[2019-09-10 03:05:53,519 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-09-10 03:05:53,523 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-09-10 03:05:53,523 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-09-10 03:05:53,531 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-09-10 03:05:53,532 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:05:52" (1/3) ...
[2019-09-10 03:05:53,533 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5b91e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:05:53, skipping insertion in model container
[2019-09-10 03:05:53,533 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:53" (2/3) ...
[2019-09-10 03:05:53,535 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5b91e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:05:53, skipping insertion in model container
[2019-09-10 03:05:53,536 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:05:53" (3/3) ...
[2019-09-10 03:05:53,537 INFO  L109   eAbstractionObserver]: Analyzing ICFG fibo_5-2.c
[2019-09-10 03:05:53,548 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-09-10 03:05:53,561 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-09-10 03:05:53,578 INFO  L252      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-09-10 03:05:53,609 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2019-09-10 03:05:53,609 INFO  L378      AbstractCegarLoop]: Hoare is false
[2019-09-10 03:05:53,612 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-09-10 03:05:53,612 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-09-10 03:05:53,612 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-09-10 03:05:53,612 INFO  L382      AbstractCegarLoop]: Difference is false
[2019-09-10 03:05:53,612 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-09-10 03:05:53,613 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-09-10 03:05:53,629 INFO  L276                IsEmpty]: Start isEmpty. Operand 24 states.
[2019-09-10 03:05:53,644 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2019-09-10 03:05:53,644 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 03:05:53,645 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-10 03:05:53,646 INFO  L418      AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 03:05:53,650 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 03:05:53,650 INFO  L82        PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times
[2019-09-10 03:05:53,652 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 03:05:53,690 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:53,691 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 03:05:53,691 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:53,691 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 03:05:53,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 03:05:53,871 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-10 03:05:53,875 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-10 03:05:53,875 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-10 03:05:53,876 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 03:05:53,892 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-10 03:05:53,921 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-10 03:05:53,922 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-10 03:05:53,927 INFO  L87              Difference]: Start difference. First operand 24 states. Second operand 5 states.
[2019-09-10 03:05:54,030 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 03:05:54,030 INFO  L93              Difference]: Finished difference Result 26 states and 30 transitions.
[2019-09-10 03:05:54,035 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-10 03:05:54,037 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2019-09-10 03:05:54,037 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 03:05:54,046 INFO  L225             Difference]: With dead ends: 26
[2019-09-10 03:05:54,047 INFO  L226             Difference]: Without dead ends: 21
[2019-09-10 03:05:54,048 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2019-09-10 03:05:54,062 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2019-09-10 03:05:54,082 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2019-09-10 03:05:54,084 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2019-09-10 03:05:54,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions.
[2019-09-10 03:05:54,086 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13
[2019-09-10 03:05:54,087 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 03:05:54,087 INFO  L475      AbstractCegarLoop]: Abstraction has 21 states and 25 transitions.
[2019-09-10 03:05:54,087 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-10 03:05:54,087 INFO  L276                IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions.
[2019-09-10 03:05:54,089 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2019-09-10 03:05:54,089 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 03:05:54,089 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-10 03:05:54,093 INFO  L418      AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 03:05:54,093 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 03:05:54,093 INFO  L82        PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times
[2019-09-10 03:05:54,094 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 03:05:54,095 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:54,095 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 03:05:54,095 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:54,095 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 03:05:54,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 03:05:54,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-10 03:05:54,142 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-10 03:05:54,143 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-10 03:05:54,143 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 03:05:54,146 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-10 03:05:54,147 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-10 03:05:54,147 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-10 03:05:54,147 INFO  L87              Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states.
[2019-09-10 03:05:54,213 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 03:05:54,213 INFO  L93              Difference]: Finished difference Result 23 states and 28 transitions.
[2019-09-10 03:05:54,214 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-10 03:05:54,214 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2019-09-10 03:05:54,215 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 03:05:54,216 INFO  L225             Difference]: With dead ends: 23
[2019-09-10 03:05:54,216 INFO  L226             Difference]: Without dead ends: 23
[2019-09-10 03:05:54,217 INFO  L628         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
[2019-09-10 03:05:54,217 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2019-09-10 03:05:54,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21.
[2019-09-10 03:05:54,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2019-09-10 03:05:54,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions.
[2019-09-10 03:05:54,224 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14
[2019-09-10 03:05:54,225 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 03:05:54,225 INFO  L475      AbstractCegarLoop]: Abstraction has 21 states and 25 transitions.
[2019-09-10 03:05:54,225 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-10 03:05:54,225 INFO  L276                IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions.
[2019-09-10 03:05:54,226 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2019-09-10 03:05:54,226 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 03:05:54,227 INFO  L399         BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-10 03:05:54,227 INFO  L418      AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 03:05:54,227 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 03:05:54,228 INFO  L82        PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times
[2019-09-10 03:05:54,228 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 03:05:54,229 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:54,229 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 03:05:54,229 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:54,229 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 03:05:54,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 03:05:54,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2019-09-10 03:05:54,330 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-09-10 03:05:54,331 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-09-10 03:05:54,332 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: 
[2019-09-10 03:05:54,334 INFO  L207      CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [33], [34], [36], [37], [38], [39], [40], [41]
[2019-09-10 03:05:54,368 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-09-10 03:05:54,368 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-09-10 03:05:54,455 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-09-10 03:05:54,457 INFO  L272    AbstractInterpreter]: Visited 17 different actions 49 times. Never merged. Widened at 1 different actions 1 times. Performed 45 root evaluator evaluations with a maximum evaluation depth of 3. Performed 45 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 5 variables.
[2019-09-10 03:05:54,460 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 03:05:54,460 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-09-10 03:05:54,498 INFO  L227   lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes.
[2019-09-10 03:05:54,498 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-09-10 03:05:54,536 INFO  L420   sIntCurrentIteration]: We unified 25 AI predicates to 25
[2019-09-10 03:05:54,537 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-09-10 03:05:54,538 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-09-10 03:05:54,538 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11
[2019-09-10 03:05:54,538 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 03:05:54,539 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-09-10 03:05:54,539 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-09-10 03:05:54,539 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-09-10 03:05:54,539 INFO  L87              Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states.
[2019-09-10 03:05:54,801 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 03:05:54,801 INFO  L93              Difference]: Finished difference Result 39 states and 48 transitions.
[2019-09-10 03:05:54,802 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-09-10 03:05:54,802 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 26
[2019-09-10 03:05:54,802 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 03:05:54,804 INFO  L225             Difference]: With dead ends: 39
[2019-09-10 03:05:54,804 INFO  L226             Difference]: Without dead ends: 39
[2019-09-10 03:05:54,805 INFO  L628         BasicCegarLoop]: 0 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
[2019-09-10 03:05:54,805 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2019-09-10 03:05:54,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37.
[2019-09-10 03:05:54,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2019-09-10 03:05:54,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions.
[2019-09-10 03:05:54,813 INFO  L78                 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 26
[2019-09-10 03:05:54,814 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 03:05:54,814 INFO  L475      AbstractCegarLoop]: Abstraction has 37 states and 42 transitions.
[2019-09-10 03:05:54,814 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-09-10 03:05:54,814 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions.
[2019-09-10 03:05:54,816 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2019-09-10 03:05:54,816 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 03:05:54,816 INFO  L399         BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-10 03:05:54,817 INFO  L418      AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 03:05:54,817 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 03:05:54,817 INFO  L82        PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times
[2019-09-10 03:05:54,817 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 03:05:54,818 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:54,819 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 03:05:54,819 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:54,819 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 03:05:54,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 03:05:54,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2019-09-10 03:05:54,921 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-09-10 03:05:54,921 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-09-10 03:05:54,922 INFO  L189      CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program
[2019-09-10 03:05:54,923 INFO  L422   seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints
[2019-09-10 03:05:54,923 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-09-10 03:05:54,923 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
[2019-09-10 03:05:54,940 INFO  L103   rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2019-09-10 03:05:54,941 INFO  L289   anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2019-09-10 03:05:54,974 INFO  L249   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2019-09-10 03:05:54,975 INFO  L250   tOrderPrioritization]: Conjunction of SSA is unsat
[2019-09-10 03:05:54,976 INFO  L256         TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-09-10 03:05:54,983 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2019-09-10 03:05:55,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2019-09-10 03:05:55,052 INFO  L322         TraceCheckSpWp]: Computing backward predicates...
[2019-09-10 03:05:55,215 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-10 03:05:55,286 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2019-09-10 03:05:55,291 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-09-10 03:05:55,291 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11
[2019-09-10 03:05:55,291 INFO  L250   anRefinementStrategy]: Using the first two imperfect interpolant sequences
[2019-09-10 03:05:55,293 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 8 states
[2019-09-10 03:05:55,293 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2019-09-10 03:05:55,294 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2019-09-10 03:05:55,294 INFO  L87              Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 8 states.
[2019-09-10 03:05:55,435 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 03:05:55,435 INFO  L93              Difference]: Finished difference Result 50 states and 64 transitions.
[2019-09-10 03:05:55,435 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2019-09-10 03:05:55,436 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 39
[2019-09-10 03:05:55,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 03:05:55,437 INFO  L225             Difference]: With dead ends: 50
[2019-09-10 03:05:55,438 INFO  L226             Difference]: Without dead ends: 47
[2019-09-10 03:05:55,440 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240
[2019-09-10 03:05:55,441 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2019-09-10 03:05:55,451 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39.
[2019-09-10 03:05:55,455 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2019-09-10 03:05:55,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions.
[2019-09-10 03:05:55,456 INFO  L78                 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 39
[2019-09-10 03:05:55,457 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 03:05:55,457 INFO  L475      AbstractCegarLoop]: Abstraction has 39 states and 45 transitions.
[2019-09-10 03:05:55,459 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2019-09-10 03:05:55,459 INFO  L276                IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions.
[2019-09-10 03:05:55,463 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2019-09-10 03:05:55,464 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 03:05:55,464 INFO  L399         BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-10 03:05:55,464 INFO  L418      AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 03:05:55,464 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 03:05:55,465 INFO  L82        PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 1 times
[2019-09-10 03:05:55,465 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 03:05:55,467 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:55,467 INFO  L101   rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2019-09-10 03:05:55,468 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:55,468 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 03:05:55,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 03:05:55,562 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2019-09-10 03:05:55,562 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-09-10 03:05:55,562 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-09-10 03:05:55,563 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: 
[2019-09-10 03:05:55,563 INFO  L207      CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [33], [34], [36], [37], [38], [39], [40], [41]
[2019-09-10 03:05:55,566 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-09-10 03:05:55,566 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-09-10 03:05:55,667 INFO  L263    AbstractInterpreter]: Some error location(s) were reachable
[2019-09-10 03:05:55,668 INFO  L272    AbstractInterpreter]: Visited 22 different actions 237 times. Merged at 8 different actions 24 times. Widened at 1 different actions 1 times. Performed 263 root evaluator evaluations with a maximum evaluation depth of 3. Performed 263 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 5 variables.
[2019-09-10 03:05:55,668 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 03:05:55,669 INFO  L422   seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown
[2019-09-10 03:05:55,669 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-09-10 03:05:55,669 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
[2019-09-10 03:05:55,685 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 03:05:55,686 INFO  L289   anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2019-09-10 03:05:55,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 03:05:55,709 INFO  L256         TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-09-10 03:05:55,711 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2019-09-10 03:05:55,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2019-09-10 03:05:55,725 INFO  L322         TraceCheckSpWp]: Computing backward predicates...
[2019-09-10 03:05:55,974 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-10 03:05:56,029 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-10 03:05:56,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2019-09-10 03:05:56,077 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-09-10 03:05:56,077 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11
[2019-09-10 03:05:56,077 INFO  L250   anRefinementStrategy]: Using the first two imperfect interpolant sequences
[2019-09-10 03:05:56,078 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-09-10 03:05:56,078 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-09-10 03:05:56,079 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2019-09-10 03:05:56,079 INFO  L87              Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 7 states.
[2019-09-10 03:05:56,197 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 03:05:56,197 INFO  L93              Difference]: Finished difference Result 66 states and 107 transitions.
[2019-09-10 03:05:56,197 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-09-10 03:05:56,198 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 41
[2019-09-10 03:05:56,198 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 03:05:56,200 INFO  L225             Difference]: With dead ends: 66
[2019-09-10 03:05:56,200 INFO  L226             Difference]: Without dead ends: 56
[2019-09-10 03:05:56,201 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182
[2019-09-10 03:05:56,201 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2019-09-10 03:05:56,215 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41.
[2019-09-10 03:05:56,216 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2019-09-10 03:05:56,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions.
[2019-09-10 03:05:56,219 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 41
[2019-09-10 03:05:56,219 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 03:05:56,219 INFO  L475      AbstractCegarLoop]: Abstraction has 41 states and 49 transitions.
[2019-09-10 03:05:56,219 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-09-10 03:05:56,219 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions.
[2019-09-10 03:05:56,226 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2019-09-10 03:05:56,226 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 03:05:56,227 INFO  L399         BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-10 03:05:56,227 INFO  L418      AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 03:05:56,227 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 03:05:56,227 INFO  L82        PathProgramCache]: Analyzing trace with hash 1437629917, now seen corresponding path program 2 times
[2019-09-10 03:05:56,227 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 03:05:56,231 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:56,232 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 03:05:56,232 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:56,232 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 03:05:56,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 03:05:56,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 183 backedges. 65 proven. 39 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked.
[2019-09-10 03:05:56,395 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-09-10 03:05:56,396 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-09-10 03:05:56,396 INFO  L189      CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program
[2019-09-10 03:05:56,396 INFO  L422   seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints
[2019-09-10 03:05:56,396 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-09-10 03:05:56,396 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
[2019-09-10 03:05:56,418 INFO  L103   rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2019-09-10 03:05:56,418 INFO  L289   anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2019-09-10 03:05:56,438 INFO  L249   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2019-09-10 03:05:56,439 INFO  L250   tOrderPrioritization]: Conjunction of SSA is unsat
[2019-09-10 03:05:56,440 INFO  L256         TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-09-10 03:05:56,443 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2019-09-10 03:05:56,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 183 backedges. 64 proven. 24 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2019-09-10 03:05:56,487 INFO  L322         TraceCheckSpWp]: Computing backward predicates...
[2019-09-10 03:05:56,708 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-10 03:05:56,756 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-10 03:05:56,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 183 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked.
[2019-09-10 03:05:56,832 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-09-10 03:05:56,832 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 9] total 16
[2019-09-10 03:05:56,832 INFO  L250   anRefinementStrategy]: Using the first two imperfect interpolant sequences
[2019-09-10 03:05:56,834 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-09-10 03:05:56,834 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-09-10 03:05:56,834 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240
[2019-09-10 03:05:56,835 INFO  L87              Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 13 states.
[2019-09-10 03:05:57,289 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 03:05:57,290 INFO  L93              Difference]: Finished difference Result 88 states and 124 transitions.
[2019-09-10 03:05:57,290 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2019-09-10 03:05:57,290 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 67
[2019-09-10 03:05:57,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 03:05:57,293 INFO  L225             Difference]: With dead ends: 88
[2019-09-10 03:05:57,294 INFO  L226             Difference]: Without dead ends: 73
[2019-09-10 03:05:57,294 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 123 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=536, Unknown=0, NotChecked=0, Total=756
[2019-09-10 03:05:57,295 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2019-09-10 03:05:57,304 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67.
[2019-09-10 03:05:57,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2019-09-10 03:05:57,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions.
[2019-09-10 03:05:57,306 INFO  L78                 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 67
[2019-09-10 03:05:57,306 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 03:05:57,307 INFO  L475      AbstractCegarLoop]: Abstraction has 67 states and 91 transitions.
[2019-09-10 03:05:57,307 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-09-10 03:05:57,307 INFO  L276                IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions.
[2019-09-10 03:05:57,310 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2019-09-10 03:05:57,310 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 03:05:57,310 INFO  L399         BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-10 03:05:57,310 INFO  L418      AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 03:05:57,310 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 03:05:57,311 INFO  L82        PathProgramCache]: Analyzing trace with hash 1200034344, now seen corresponding path program 3 times
[2019-09-10 03:05:57,311 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 03:05:57,312 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:57,312 INFO  L101   rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2019-09-10 03:05:57,312 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 03:05:57,312 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 03:05:57,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-09-10 03:05:57,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-09-10 03:05:57,445 INFO  L466         BasicCegarLoop]: Counterexample might be feasible
[2019-09-10 03:05:57,477 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:05:57 BoogieIcfgContainer
[2019-09-10 03:05:57,478 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-09-10 03:05:57,480 INFO  L168              Benchmark]: Toolchain (without parser) took 4650.98 ms. Allocated memory was 134.2 MB in the beginning and 255.9 MB in the end (delta: 121.6 MB). Free memory was 90.8 MB in the beginning and 186.0 MB in the end (delta: -95.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB.
[2019-09-10 03:05:57,481 INFO  L168              Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB.
[2019-09-10 03:05:57,482 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 278.94 ms. Allocated memory is still 134.2 MB. Free memory was 90.6 MB in the beginning and 81.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB.
[2019-09-10 03:05:57,483 INFO  L168              Benchmark]: Boogie Preprocessor took 37.31 ms. Allocated memory is still 134.2 MB. Free memory was 81.7 MB in the beginning and 80.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB.
[2019-09-10 03:05:57,484 INFO  L168              Benchmark]: RCFGBuilder took 370.51 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 80.2 MB in the beginning and 167.9 MB in the end (delta: -87.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB.
[2019-09-10 03:05:57,485 INFO  L168              Benchmark]: TraceAbstraction took 3954.75 ms. Allocated memory was 201.3 MB in the beginning and 255.9 MB in the end (delta: 54.5 MB). Free memory was 167.3 MB in the beginning and 186.0 MB in the end (delta: -18.7 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB.
[2019-09-10 03:05:57,489 INFO  L335   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 278.94 ms. Allocated memory is still 134.2 MB. Free memory was 90.6 MB in the beginning and 81.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 37.31 ms. Allocated memory is still 134.2 MB. Free memory was 81.7 MB in the beginning and 80.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 370.51 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 80.2 MB in the beginning and 167.9 MB in the end (delta: -87.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 3954.75 ms. Allocated memory was 201.3 MB in the beginning and 255.9 MB in the end (delta: 54.5 MB). Free memory was 167.3 MB in the beginning and 186.0 MB in the end (delta: -18.7 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L24]              int x = 5;
       VAL         [x=5]
[L25]  CALL, EXPR  fibo(x)
       VAL         [\old(n)=5]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=5, n=5]
[L8]   COND FALSE  !(n == 1)
       VAL         [\old(n)=5, n=5]
[L11]  CALL, EXPR  fibo(n-1)
       VAL         [\old(n)=4]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=4, n=4]
[L8]   COND FALSE  !(n == 1)
       VAL         [\old(n)=4, n=4]
[L11]  CALL, EXPR  fibo(n-1)
       VAL         [\old(n)=3]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=3, n=3]
[L8]   COND FALSE  !(n == 1)
       VAL         [\old(n)=3, n=3]
[L11]  CALL, EXPR  fibo(n-1)
       VAL         [\old(n)=2]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=2, n=2]
[L8]   COND FALSE  !(n == 1)
       VAL         [\old(n)=2, n=2]
[L11]  CALL, EXPR  fibo(n-1)
       VAL         [\old(n)=1]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=1, n=1]
[L8]   COND TRUE   n == 1
[L9]               return 1;
       VAL         [\old(n)=1, \result=1, n=1]
[L11]  RET, EXPR   fibo(n-1)
       VAL         [\old(n)=2, fibo(n-1)=1, n=2]
[L11]  CALL, EXPR  fibo(n-2)
       VAL         [\old(n)=0]
[L6]   COND TRUE   n < 1
[L7]               return 0;
       VAL         [\old(n)=0, \result=0, n=0]
[L11]  RET, EXPR   fibo(n-2)
       VAL         [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2]
[L11]              return fibo(n-1) + fibo(n-2);
[L11]  RET, EXPR   fibo(n-1)
       VAL         [\old(n)=3, fibo(n-1)=1, n=3]
[L11]  CALL, EXPR  fibo(n-2)
       VAL         [\old(n)=1]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=1, n=1]
[L8]   COND TRUE   n == 1
[L9]               return 1;
       VAL         [\old(n)=1, \result=1, n=1]
[L11]  RET, EXPR   fibo(n-2)
       VAL         [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3]
[L11]              return fibo(n-1) + fibo(n-2);
[L11]  RET, EXPR   fibo(n-1)
       VAL         [\old(n)=4, fibo(n-1)=2, n=4]
[L11]  CALL, EXPR  fibo(n-2)
       VAL         [\old(n)=2]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=2, n=2]
[L8]   COND FALSE  !(n == 1)
       VAL         [\old(n)=2, n=2]
[L11]  CALL, EXPR  fibo(n-1)
       VAL         [\old(n)=1]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=1, n=1]
[L8]   COND TRUE   n == 1
[L9]               return 1;
       VAL         [\old(n)=1, \result=1, n=1]
[L11]  RET, EXPR   fibo(n-1)
       VAL         [\old(n)=2, fibo(n-1)=1, n=2]
[L11]  CALL, EXPR  fibo(n-2)
       VAL         [\old(n)=0]
[L6]   COND TRUE   n < 1
[L7]               return 0;
       VAL         [\old(n)=0, \result=0, n=0]
[L11]  RET, EXPR   fibo(n-2)
       VAL         [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2]
[L11]              return fibo(n-1) + fibo(n-2);
[L11]  RET, EXPR   fibo(n-2)
       VAL         [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4]
[L11]              return fibo(n-1) + fibo(n-2);
[L11]  RET, EXPR   fibo(n-1)
       VAL         [\old(n)=5, fibo(n-1)=3, n=5]
[L11]  CALL, EXPR  fibo(n-2)
       VAL         [\old(n)=3]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=3, n=3]
[L8]   COND FALSE  !(n == 1)
       VAL         [\old(n)=3, n=3]
[L11]  CALL, EXPR  fibo(n-1)
       VAL         [\old(n)=2]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=2, n=2]
[L8]   COND FALSE  !(n == 1)
       VAL         [\old(n)=2, n=2]
[L11]  CALL, EXPR  fibo(n-1)
       VAL         [\old(n)=1]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=1, n=1]
[L8]   COND TRUE   n == 1
[L9]               return 1;
       VAL         [\old(n)=1, \result=1, n=1]
[L11]  RET, EXPR   fibo(n-1)
       VAL         [\old(n)=2, fibo(n-1)=1, n=2]
[L11]  CALL, EXPR  fibo(n-2)
       VAL         [\old(n)=0]
[L6]   COND TRUE   n < 1
[L7]               return 0;
       VAL         [\old(n)=0, \result=0, n=0]
[L11]  RET, EXPR   fibo(n-2)
       VAL         [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2]
[L11]              return fibo(n-1) + fibo(n-2);
[L11]  RET, EXPR   fibo(n-1)
       VAL         [\old(n)=3, fibo(n-1)=1, n=3]
[L11]  CALL, EXPR  fibo(n-2)
       VAL         [\old(n)=1]
[L6]   COND FALSE  !(n < 1)
       VAL         [\old(n)=1, n=1]
[L8]   COND TRUE   n == 1
[L9]               return 1;
       VAL         [\old(n)=1, \result=1, n=1]
[L11]  RET, EXPR   fibo(n-2)
       VAL         [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3]
[L11]              return fibo(n-1) + fibo(n-2);
[L11]  RET, EXPR   fibo(n-2)
       VAL         [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5]
[L11]              return fibo(n-1) + fibo(n-2);
[L25]  RET, EXPR   fibo(x)
       VAL         [fibo(x)=5, x=5]
[L25]              int result = fibo(x);
[L26]  COND TRUE   result == 5
       VAL         [result=5, x=5]
[L27]              __VERIFIER_error()
       VAL         [result=5, x=5]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 3.8s OverallTime, 7 OverallIterations, 15 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 112 SDtfs, 175 SDslu, 335 SDs, 0 SdLazy, 331 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 295 SyntacticMatches, 18 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.84 AbsIntWeakeningRatio, 0.56 AbsIntAvgWeakeningVarsNumRemoved, 0.16 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 456 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 45590 SizeOfPredicates, 11 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 649/846 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...