java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl


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


This is Ultimate 0.1.24-a9d37a5-m
[2019-02-28 10:52:30,068 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2019-02-28 10:52:30,072 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-02-28 10:52:30,088 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-02-28 10:52:30,089 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-02-28 10:52:30,091 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-02-28 10:52:30,093 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-02-28 10:52:30,096 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-02-28 10:52:30,097 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-02-28 10:52:30,100 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-02-28 10:52:30,103 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-02-28 10:52:30,103 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-02-28 10:52:30,104 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-02-28 10:52:30,105 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-02-28 10:52:30,115 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-02-28 10:52:30,116 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-02-28 10:52:30,116 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-02-28 10:52:30,121 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-02-28 10:52:30,124 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-02-28 10:52:30,125 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-02-28 10:52:30,126 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-02-28 10:52:30,127 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-02-28 10:52:30,130 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-02-28 10:52:30,130 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-02-28 10:52:30,130 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-02-28 10:52:30,131 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-02-28 10:52:30,133 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-02-28 10:52:30,136 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-02-28 10:52:30,137 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-02-28 10:52:30,138 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-02-28 10:52:30,140 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2019-02-28 10:52:30,141 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-02-28 10:52:30,142 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-02-28 10:52:30,143 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2019-02-28 10:52:30,144 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-02-28 10:52:30,145 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2019-02-28 10:52:30,146 INFO  L98         SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf
[2019-02-28 10:52:30,168 INFO  L110        SettingsManager]: Loading preferences was successful
[2019-02-28 10:52:30,168 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2019-02-28 10:52:30,170 INFO  L131        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2019-02-28 10:52:30,170 INFO  L133        SettingsManager]:  * Show backtranslation warnings=false
[2019-02-28 10:52:30,170 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2019-02-28 10:52:30,171 INFO  L133        SettingsManager]:  * User list type=DISABLED
[2019-02-28 10:52:30,171 INFO  L133        SettingsManager]:  * Inline calls to unimplemented procedures=true
[2019-02-28 10:52:30,171 INFO  L131        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2019-02-28 10:52:30,172 INFO  L133        SettingsManager]:  * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2019-02-28 10:52:30,172 INFO  L133        SettingsManager]:  * Underlying domain=OctagonDomain
[2019-02-28 10:52:30,172 INFO  L133        SettingsManager]:  * Abstract domain=ArrayDomain
[2019-02-28 10:52:30,172 INFO  L133        SettingsManager]:  * Check feasibility of abstract posts with an SMT solver=true
[2019-02-28 10:52:30,172 INFO  L133        SettingsManager]:  * Interval Domain=false
[2019-02-28 10:52:30,173 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-02-28 10:52:30,173 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2019-02-28 10:52:30,174 INFO  L133        SettingsManager]:  * Use SBE=true
[2019-02-28 10:52:30,175 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-02-28 10:52:30,175 INFO  L133        SettingsManager]:  * sizeof long=4
[2019-02-28 10:52:30,175 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-02-28 10:52:30,176 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2019-02-28 10:52:30,176 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2019-02-28 10:52:30,176 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-02-28 10:52:30,176 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-02-28 10:52:30,176 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-02-28 10:52:30,177 INFO  L133        SettingsManager]:  * sizeof long double=12
[2019-02-28 10:52:30,178 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2019-02-28 10:52:30,178 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-02-28 10:52:30,178 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-02-28 10:52:30,179 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-02-28 10:52:30,179 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-02-28 10:52:30,179 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000
[2019-02-28 10:52:30,179 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-02-28 10:52:30,179 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-02-28 10:52:30,180 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-02-28 10:52:30,180 INFO  L133        SettingsManager]:  * Trace refinement strategy=TAIPAN
[2019-02-28 10:52:30,180 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-02-28 10:52:30,180 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in
[2019-02-28 10:52:30,181 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-02-28 10:52:30,181 INFO  L133        SettingsManager]:  * Abstract interpretation Mode=USE_PREDICATES
[2019-02-28 10:52:30,234 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-02-28 10:52:30,247 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-02-28 10:52:30,251 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-02-28 10:52:30,252 INFO  L271        PluginConnector]: Initializing Boogie PL CUP Parser...
[2019-02-28 10:52:30,253 INFO  L276        PluginConnector]: Boogie PL CUP Parser initialized
[2019-02-28 10:52:30,254 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl
[2019-02-28 10:52:30,254 INFO  L111           BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl'
[2019-02-28 10:52:30,302 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-02-28 10:52:30,304 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-02-28 10:52:30,305 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-02-28 10:52:30,305 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-02-28 10:52:30,305 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2019-02-28 10:52:30,323 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:30" (1/1) ...
[2019-02-28 10:52:30,338 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:30" (1/1) ...
[2019-02-28 10:52:30,369 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-02-28 10:52:30,370 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-02-28 10:52:30,370 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-02-28 10:52:30,370 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2019-02-28 10:52:30,383 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:30" (1/1) ...
[2019-02-28 10:52:30,383 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:30" (1/1) ...
[2019-02-28 10:52:30,385 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:30" (1/1) ...
[2019-02-28 10:52:30,385 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:30" (1/1) ...
[2019-02-28 10:52:30,391 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:30" (1/1) ...
[2019-02-28 10:52:30,396 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:30" (1/1) ...
[2019-02-28 10:52:30,398 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:30" (1/1) ...
[2019-02-28 10:52:30,399 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-02-28 10:52:30,404 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-02-28 10:52:30,404 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-02-28 10:52:30,404 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2019-02-28 10:52:30,405 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:30" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000
[2019-02-28 10:52:30,473 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-02-28 10:52:30,473 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-02-28 10:52:30,728 INFO  L281             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-02-28 10:52:30,729 INFO  L286             CfgBuilder]: Removed 13 assue(true) statements.
[2019-02-28 10:52:30,731 INFO  L202        PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:52:30 BoogieIcfgContainer
[2019-02-28 10:52:30,731 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-02-28 10:52:30,733 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-02-28 10:52:30,733 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-02-28 10:52:30,736 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2019-02-28 10:52:30,737 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:30" (1/2) ...
[2019-02-28 10:52:30,738 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbd528 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:52:30, skipping insertion in model container
[2019-02-28 10:52:30,738 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:52:30" (2/2) ...
[2019-02-28 10:52:30,740 INFO  L112   eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl
[2019-02-28 10:52:30,752 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-02-28 10:52:30,770 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations.
[2019-02-28 10:52:30,815 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2019-02-28 10:52:30,857 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2019-02-28 10:52:30,857 INFO  L383      AbstractCegarLoop]: Hoare is true
[2019-02-28 10:52:30,858 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-02-28 10:52:30,858 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-02-28 10:52:30,858 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-02-28 10:52:30,858 INFO  L387      AbstractCegarLoop]: Difference is false
[2019-02-28 10:52:30,858 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-02-28 10:52:30,859 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-02-28 10:52:30,879 INFO  L276                IsEmpty]: Start isEmpty. Operand 13 states.
[2019-02-28 10:52:30,891 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 3
[2019-02-28 10:52:30,892 INFO  L394         BasicCegarLoop]: Found error trace
[2019-02-28 10:52:30,893 INFO  L402         BasicCegarLoop]: trace histogram [1, 1]
[2019-02-28 10:52:30,898 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]===
[2019-02-28 10:52:30,904 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 10:52:30,905 INFO  L82        PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times
[2019-02-28 10:52:30,908 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-28 10:52:30,956 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:52:30,957 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-28 10:52:30,957 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:52:30,957 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-28 10:52:31,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-28 10:52:31,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-02-28 10:52:31,092 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-02-28 10:52:31,092 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2019-02-28 10:52:31,092 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-02-28 10:52:31,096 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-02-28 10:52:31,106 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-02-28 10:52:31,107 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 10:52:31,109 INFO  L87              Difference]: Start difference. First operand 13 states. Second operand 3 states.
[2019-02-28 10:52:31,341 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-28 10:52:31,341 INFO  L93              Difference]: Finished difference Result 25 states and 33 transitions.
[2019-02-28 10:52:31,342 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-02-28 10:52:31,343 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 2
[2019-02-28 10:52:31,343 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-28 10:52:31,358 INFO  L225             Difference]: With dead ends: 25
[2019-02-28 10:52:31,358 INFO  L226             Difference]: Without dead ends: 20
[2019-02-28 10:52:31,362 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 10:52:31,380 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2019-02-28 10:52:31,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12.
[2019-02-28 10:52:31,396 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2019-02-28 10:52:31,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions.
[2019-02-28 10:52:31,398 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2
[2019-02-28 10:52:31,399 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-02-28 10:52:31,399 INFO  L480      AbstractCegarLoop]: Abstraction has 12 states and 21 transitions.
[2019-02-28 10:52:31,400 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-02-28 10:52:31,400 INFO  L276                IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions.
[2019-02-28 10:52:31,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2019-02-28 10:52:31,400 INFO  L394         BasicCegarLoop]: Found error trace
[2019-02-28 10:52:31,401 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1]
[2019-02-28 10:52:31,401 INFO  L423      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]===
[2019-02-28 10:52:31,401 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 10:52:31,402 INFO  L82        PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times
[2019-02-28 10:52:31,402 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-28 10:52:31,403 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:52:31,403 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-28 10:52:31,404 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:52:31,404 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-28 10:52:31,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-28 10:52:31,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-02-28 10:52:31,546 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-28 10:52:31,546 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-02-28 10:52:31,547 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: 
[2019-02-28 10:52:31,549 INFO  L207      CegarAbsIntRunner]: [0], [18], [23]
[2019-02-28 10:52:31,621 INFO  L148    AbstractInterpreter]: Using domain ArrayDomain
[2019-02-28 10:52:31,622 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)
[2019-02-28 10:52:42,100 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-02-28 10:52:42,102 INFO  L272    AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables.
[2019-02-28 10:52:42,106 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 10:52:42,107 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-02-28 10:52:42,648 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-02-28 10:52:54,079 INFO  L420   sIntCurrentIteration]: We unified 2 AI predicates to 2
[2019-02-28 10:52:54,080 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-02-28 10:52:54,082 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-02-28 10:52:54,083 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3
[2019-02-28 10:52:54,083 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-02-28 10:52:54,084 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-02-28 10:52:54,084 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-02-28 10:52:54,085 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 10:52:54,085 INFO  L87              Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 3 states.
[2019-02-28 10:54:55,735 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-28 10:54:55,736 INFO  L93              Difference]: Finished difference Result 22 states and 35 transitions.
[2019-02-28 10:54:55,736 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-02-28 10:54:55,736 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2019-02-28 10:54:55,736 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-28 10:54:55,737 INFO  L225             Difference]: With dead ends: 22
[2019-02-28 10:54:55,738 INFO  L226             Difference]: Without dead ends: 13
[2019-02-28 10:54:55,739 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 10:54:55,741 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2019-02-28 10:54:55,744 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12.
[2019-02-28 10:54:55,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2019-02-28 10:54:55,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions.
[2019-02-28 10:54:55,746 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 3
[2019-02-28 10:54:55,746 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-02-28 10:54:55,747 INFO  L480      AbstractCegarLoop]: Abstraction has 12 states and 20 transitions.
[2019-02-28 10:54:55,747 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-02-28 10:54:55,747 INFO  L276                IsEmpty]: Start isEmpty. Operand 12 states and 20 transitions.
[2019-02-28 10:54:55,748 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2019-02-28 10:54:55,748 INFO  L394         BasicCegarLoop]: Found error trace
[2019-02-28 10:54:55,748 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1]
[2019-02-28 10:54:55,749 INFO  L423      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]===
[2019-02-28 10:54:55,749 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 10:54:55,749 INFO  L82        PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times
[2019-02-28 10:54:55,749 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-28 10:54:55,751 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:54:55,752 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-28 10:54:55,752 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:54:55,752 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-28 10:54:55,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-28 10:54:55,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-02-28 10:54:55,946 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-28 10:54:55,946 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-02-28 10:54:55,946 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: 
[2019-02-28 10:54:55,947 INFO  L207      CegarAbsIntRunner]: [0], [20], [23]
[2019-02-28 10:54:55,950 INFO  L148    AbstractInterpreter]: Using domain ArrayDomain
[2019-02-28 10:54:55,950 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)
[2019-02-28 10:55:03,129 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-02-28 10:55:03,129 INFO  L272    AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables.
[2019-02-28 10:55:03,130 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 10:55:03,130 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-02-28 10:55:03,432 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-02-28 10:55:07,105 INFO  L420   sIntCurrentIteration]: We unified 2 AI predicates to 2
[2019-02-28 10:55:07,106 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-02-28 10:55:07,106 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-02-28 10:55:07,106 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3
[2019-02-28 10:55:07,106 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-02-28 10:55:07,107 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-02-28 10:55:07,107 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-02-28 10:55:07,107 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 10:55:07,107 INFO  L87              Difference]: Start difference. First operand 12 states and 20 transitions. Second operand 3 states.
[2019-02-28 10:55:45,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-28 10:55:45,553 INFO  L93              Difference]: Finished difference Result 23 states and 39 transitions.
[2019-02-28 10:55:45,553 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-02-28 10:55:45,554 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2019-02-28 10:55:45,554 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-28 10:55:45,555 INFO  L225             Difference]: With dead ends: 23
[2019-02-28 10:55:45,555 INFO  L226             Difference]: Without dead ends: 14
[2019-02-28 10:55:45,556 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 10:55:45,557 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2019-02-28 10:55:45,561 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2019-02-28 10:55:45,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2019-02-28 10:55:45,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions.
[2019-02-28 10:55:45,562 INFO  L78                 Accepts]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 3
[2019-02-28 10:55:45,562 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-02-28 10:55:45,563 INFO  L480      AbstractCegarLoop]: Abstraction has 14 states and 30 transitions.
[2019-02-28 10:55:45,563 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-02-28 10:55:45,563 INFO  L276                IsEmpty]: Start isEmpty. Operand 14 states and 30 transitions.
[2019-02-28 10:55:45,563 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2019-02-28 10:55:45,563 INFO  L394         BasicCegarLoop]: Found error trace
[2019-02-28 10:55:45,564 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1]
[2019-02-28 10:55:45,564 INFO  L423      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]===
[2019-02-28 10:55:45,564 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 10:55:45,564 INFO  L82        PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times
[2019-02-28 10:55:45,564 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-28 10:55:45,565 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:55:45,566 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-28 10:55:45,566 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:55:45,566 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-28 10:55:45,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-28 10:55:45,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-02-28 10:55:45,629 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-28 10:55:45,629 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-02-28 10:55:45,629 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: 
[2019-02-28 10:55:45,630 INFO  L207      CegarAbsIntRunner]: [0], [6], [23]
[2019-02-28 10:55:45,631 INFO  L148    AbstractInterpreter]: Using domain ArrayDomain
[2019-02-28 10:55:45,631 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)
[2019-02-28 10:55:53,255 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-02-28 10:55:53,255 INFO  L272    AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables.
[2019-02-28 10:55:53,256 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 10:55:53,256 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-02-28 10:55:53,517 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-02-28 10:56:04,322 INFO  L420   sIntCurrentIteration]: We unified 2 AI predicates to 2
[2019-02-28 10:56:04,322 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-02-28 10:56:04,322 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-02-28 10:56:04,322 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3
[2019-02-28 10:56:04,322 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-02-28 10:56:04,323 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-02-28 10:56:04,323 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-02-28 10:56:04,323 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 10:56:04,323 INFO  L87              Difference]: Start difference. First operand 14 states and 30 transitions. Second operand 3 states.
[2019-02-28 10:58:13,324 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-28 10:58:13,324 INFO  L93              Difference]: Finished difference Result 24 states and 44 transitions.
[2019-02-28 10:58:13,324 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-02-28 10:58:13,325 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2019-02-28 10:58:13,325 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-28 10:58:13,326 INFO  L225             Difference]: With dead ends: 24
[2019-02-28 10:58:13,326 INFO  L226             Difference]: Without dead ends: 15
[2019-02-28 10:58:13,327 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 10:58:13,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2019-02-28 10:58:13,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2019-02-28 10:58:13,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2019-02-28 10:58:13,332 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions.
[2019-02-28 10:58:13,332 INFO  L78                 Accepts]: Start accepts. Automaton has 15 states and 35 transitions. Word has length 3
[2019-02-28 10:58:13,332 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-02-28 10:58:13,333 INFO  L480      AbstractCegarLoop]: Abstraction has 15 states and 35 transitions.
[2019-02-28 10:58:13,333 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-02-28 10:58:13,333 INFO  L276                IsEmpty]: Start isEmpty. Operand 15 states and 35 transitions.
[2019-02-28 10:58:13,333 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2019-02-28 10:58:13,333 INFO  L394         BasicCegarLoop]: Found error trace
[2019-02-28 10:58:13,333 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1]
[2019-02-28 10:58:13,334 INFO  L423      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]===
[2019-02-28 10:58:13,334 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 10:58:13,334 INFO  L82        PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times
[2019-02-28 10:58:13,334 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-28 10:58:13,335 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:58:13,335 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-28 10:58:13,335 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:58:13,335 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-28 10:58:13,343 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-28 10:58:13,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-02-28 10:58:13,400 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-28 10:58:13,400 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-02-28 10:58:13,400 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: 
[2019-02-28 10:58:13,401 INFO  L207      CegarAbsIntRunner]: [0], [10], [23]
[2019-02-28 10:58:13,403 INFO  L148    AbstractInterpreter]: Using domain ArrayDomain
[2019-02-28 10:58:13,404 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)
[2019-02-28 10:58:21,044 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-02-28 10:58:21,045 INFO  L272    AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables.
[2019-02-28 10:58:21,045 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 10:58:21,045 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-02-28 10:58:21,349 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-02-28 10:58:31,321 INFO  L420   sIntCurrentIteration]: We unified 2 AI predicates to 2
[2019-02-28 10:58:31,321 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-02-28 10:58:31,322 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-02-28 10:58:31,322 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3
[2019-02-28 10:58:31,322 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-02-28 10:58:31,322 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-02-28 10:58:31,322 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-02-28 10:58:31,323 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 10:58:31,323 INFO  L87              Difference]: Start difference. First operand 15 states and 35 transitions. Second operand 3 states.
[2019-02-28 10:59:53,486 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-28 10:59:53,486 INFO  L93              Difference]: Finished difference Result 25 states and 49 transitions.
[2019-02-28 10:59:53,486 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-02-28 10:59:53,487 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2019-02-28 10:59:53,487 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-28 10:59:53,487 INFO  L225             Difference]: With dead ends: 25
[2019-02-28 10:59:53,487 INFO  L226             Difference]: Without dead ends: 16
[2019-02-28 10:59:53,488 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 10:59:53,488 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2019-02-28 10:59:53,493 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16.
[2019-02-28 10:59:53,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2019-02-28 10:59:53,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions.
[2019-02-28 10:59:53,494 INFO  L78                 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3
[2019-02-28 10:59:53,494 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-02-28 10:59:53,494 INFO  L480      AbstractCegarLoop]: Abstraction has 16 states and 40 transitions.
[2019-02-28 10:59:53,494 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-02-28 10:59:53,494 INFO  L276                IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions.
[2019-02-28 10:59:53,495 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2019-02-28 10:59:53,495 INFO  L394         BasicCegarLoop]: Found error trace
[2019-02-28 10:59:53,495 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1]
[2019-02-28 10:59:53,495 INFO  L423      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]===
[2019-02-28 10:59:53,495 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 10:59:53,496 INFO  L82        PathProgramCache]: Analyzing trace with hash 30248, now seen corresponding path program 1 times
[2019-02-28 10:59:53,496 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-28 10:59:53,496 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:59:53,497 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-28 10:59:53,497 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 10:59:53,497 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-28 10:59:53,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-28 10:59:53,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-02-28 10:59:53,555 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-28 10:59:53,556 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-02-28 10:59:53,556 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: 
[2019-02-28 10:59:53,556 INFO  L207      CegarAbsIntRunner]: [0], [14], [23]
[2019-02-28 10:59:53,557 INFO  L148    AbstractInterpreter]: Using domain ArrayDomain
[2019-02-28 10:59:53,557 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)
[2019-02-28 11:00:00,061 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-02-28 11:00:00,061 INFO  L272    AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables.
[2019-02-28 11:00:00,062 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 11:00:00,062 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-02-28 11:00:00,374 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-02-28 11:00:11,219 INFO  L420   sIntCurrentIteration]: We unified 2 AI predicates to 2
[2019-02-28 11:00:11,220 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-02-28 11:00:11,220 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-02-28 11:00:11,220 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3
[2019-02-28 11:00:11,220 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-02-28 11:00:11,220 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-02-28 11:00:11,221 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-02-28 11:00:11,221 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 11:00:11,221 INFO  L87              Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 3 states.
[2019-02-28 11:01:31,942 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-28 11:01:31,942 INFO  L93              Difference]: Finished difference Result 26 states and 54 transitions.
[2019-02-28 11:01:31,942 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-02-28 11:01:31,942 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2019-02-28 11:01:31,943 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-28 11:01:31,943 INFO  L225             Difference]: With dead ends: 26
[2019-02-28 11:01:31,943 INFO  L226             Difference]: Without dead ends: 17
[2019-02-28 11:01:31,944 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 11:01:31,944 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17 states.
[2019-02-28 11:01:31,949 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17.
[2019-02-28 11:01:31,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2019-02-28 11:01:31,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions.
[2019-02-28 11:01:31,950 INFO  L78                 Accepts]: Start accepts. Automaton has 17 states and 45 transitions. Word has length 3
[2019-02-28 11:01:31,950 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-02-28 11:01:31,951 INFO  L480      AbstractCegarLoop]: Abstraction has 17 states and 45 transitions.
[2019-02-28 11:01:31,951 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-02-28 11:01:31,951 INFO  L276                IsEmpty]: Start isEmpty. Operand 17 states and 45 transitions.
[2019-02-28 11:01:31,951 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2019-02-28 11:01:31,951 INFO  L394         BasicCegarLoop]: Found error trace
[2019-02-28 11:01:31,951 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2019-02-28 11:01:31,951 INFO  L423      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]===
[2019-02-28 11:01:31,951 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 11:01:31,952 INFO  L82        PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times
[2019-02-28 11:01:31,952 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-28 11:01:31,952 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 11:01:31,953 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-28 11:01:31,953 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 11:01:31,953 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-28 11:01:31,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-28 11:01:32,269 WARN  L181               SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17
[2019-02-28 11:01:32,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-02-28 11:01:32,296 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-28 11:01:32,296 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-02-28 11:01:32,296 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: 
[2019-02-28 11:01:32,296 INFO  L207      CegarAbsIntRunner]: [0], [18], [20], [23]
[2019-02-28 11:01:32,297 INFO  L148    AbstractInterpreter]: Using domain ArrayDomain
[2019-02-28 11:01:32,297 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)
[2019-02-28 11:01:49,987 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-02-28 11:01:49,988 INFO  L272    AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables.
[2019-02-28 11:01:49,988 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 11:01:49,988 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-02-28 11:01:50,478 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-02-28 11:02:05,523 INFO  L420   sIntCurrentIteration]: We unified 3 AI predicates to 3
[2019-02-28 11:02:05,523 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-02-28 11:02:05,523 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-02-28 11:02:05,523 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4
[2019-02-28 11:02:05,523 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-02-28 11:02:05,524 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-02-28 11:02:05,524 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-02-28 11:02:05,524 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 11:02:05,524 INFO  L87              Difference]: Start difference. First operand 17 states and 45 transitions. Second operand 3 states.
[2019-02-28 11:03:06,932 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-28 11:03:06,932 INFO  L93              Difference]: Finished difference Result 19 states and 52 transitions.
[2019-02-28 11:03:06,933 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-02-28 11:03:06,933 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 4
[2019-02-28 11:03:06,933 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-28 11:03:06,933 INFO  L225             Difference]: With dead ends: 19
[2019-02-28 11:03:06,933 INFO  L226             Difference]: Without dead ends: 18
[2019-02-28 11:03:06,934 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 11:03:06,934 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2019-02-28 11:03:06,942 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2019-02-28 11:03:06,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2019-02-28 11:03:06,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions.
[2019-02-28 11:03:06,943 INFO  L78                 Accepts]: Start accepts. Automaton has 18 states and 51 transitions. Word has length 4
[2019-02-28 11:03:06,943 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-02-28 11:03:06,943 INFO  L480      AbstractCegarLoop]: Abstraction has 18 states and 51 transitions.
[2019-02-28 11:03:06,944 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-02-28 11:03:06,944 INFO  L276                IsEmpty]: Start isEmpty. Operand 18 states and 51 transitions.
[2019-02-28 11:03:06,944 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2019-02-28 11:03:06,944 INFO  L394         BasicCegarLoop]: Found error trace
[2019-02-28 11:03:06,944 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2019-02-28 11:03:06,945 INFO  L423      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]===
[2019-02-28 11:03:06,945 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 11:03:06,945 INFO  L82        PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times
[2019-02-28 11:03:06,945 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-28 11:03:06,946 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 11:03:06,946 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-28 11:03:06,946 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-28 11:03:06,946 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-28 11:03:06,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-28 11:03:07,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-02-28 11:03:07,010 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-28 11:03:07,010 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-02-28 11:03:07,010 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: 
[2019-02-28 11:03:07,010 INFO  L207      CegarAbsIntRunner]: [0], [6], [18], [23]
[2019-02-28 11:03:07,014 INFO  L148    AbstractInterpreter]: Using domain ArrayDomain
[2019-02-28 11:03:07,014 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)
[2019-02-28 11:03:24,159 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-02-28 11:03:24,159 INFO  L272    AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables.
[2019-02-28 11:03:24,159 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-02-28 11:03:24,159 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-02-28 11:03:24,546 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-02-28 11:03:44,632 INFO  L420   sIntCurrentIteration]: We unified 3 AI predicates to 3
[2019-02-28 11:03:44,632 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-02-28 11:03:44,633 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-02-28 11:03:44,633 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4
[2019-02-28 11:03:44,633 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-02-28 11:03:44,633 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-02-28 11:03:44,633 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-02-28 11:03:44,634 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-28 11:03:44,634 INFO  L87              Difference]: Start difference. First operand 18 states and 51 transitions. Second operand 3 states.