java -ea -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/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:45:42,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:45:42,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:45:42,252 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:45:42,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:45:42,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:45:42,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:45:42,259 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:45:42,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:45:42,263 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:45:42,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:45:42,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:45:42,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:45:42,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:45:42,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:45:42,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:45:42,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:45:42,272 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:45:42,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:45:42,276 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:45:42,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:45:42,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:45:42,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:45:42,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:45:42,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:45:42,282 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:45:42,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:45:42,284 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:45:42,284 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:45:42,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:45:42,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:45:42,286 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:45:42,286 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:45:42,287 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:45:42,288 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:45:42,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:45:42,289 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 13:45:42,301 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:45:42,301 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:45:42,302 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:45:42,302 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:45:42,303 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:45:42,303 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:45:42,303 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:45:42,303 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:45:42,303 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:45:42,304 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:45:42,304 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:45:42,304 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:45:42,304 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:45:42,305 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:45:42,305 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:45:42,305 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:45:42,306 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:45:42,306 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:45:42,306 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:45:42,306 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:45:42,306 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:45:42,306 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:45:42,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:45:42,307 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:45:42,307 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:45:42,307 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:45:42,307 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:45:42,308 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:45:42,308 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:45:42,308 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:45:42,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:45:42,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:45:42,309 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:45:42,309 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:45:42,309 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:45:42,309 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:45:42,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:45:42,310 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:45:42,310 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:45:42,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:45:42,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:45:42,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:45:42,363 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:45:42,363 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:45:42,364 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl [2019-02-28 13:45:42,364 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2019-02-28 13:45:42,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:45:42,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:45:42,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:45:42,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:45:42,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:45:42,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:42" (1/1) ... [2019-02-28 13:45:42,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:42" (1/1) ... [2019-02-28 13:45:42,434 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 13:45:42,434 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 13:45:42,435 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 13:45:42,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:45:42,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:45:42,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:45:42,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:45:42,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:42" (1/1) ... [2019-02-28 13:45:42,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:42" (1/1) ... [2019-02-28 13:45:42,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:42" (1/1) ... [2019-02-28 13:45:42,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:42" (1/1) ... [2019-02-28 13:45:42,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:42" (1/1) ... [2019-02-28 13:45:42,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:42" (1/1) ... [2019-02-28 13:45:42,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:42" (1/1) ... [2019-02-28 13:45:42,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:45:42,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:45:42,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:45:42,459 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:45:42,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:42" (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 13:45:42,519 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-28 13:45:42,520 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 13:45:42,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 13:45:42,853 INFO L278 CfgBuilder]: Using library mode [2019-02-28 13:45:42,853 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-28 13:45:42,855 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:45:42 BoogieIcfgContainer [2019-02-28 13:45:42,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:45:42,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:45:42,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:45:42,859 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:45:42,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:42" (1/2) ... [2019-02-28 13:45:42,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c1fc39 and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:45:42, skipping insertion in model container [2019-02-28 13:45:42,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:45:42" (2/2) ... [2019-02-28 13:45:42,863 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2019-02-28 13:45:42,873 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:45:42,880 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:45:42,895 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:45:42,924 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:45:42,924 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:45:42,924 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:45:42,925 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:45:42,925 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:45:42,925 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:45:42,925 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:45:42,925 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:45:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 13:45:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:45:42,946 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:45:42,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:45:42,949 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:45:42,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:45:42,956 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-02-28 13:45:42,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:45:43,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:43,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:45:43,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:43,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:45:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:45:43,395 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-02-28 13:45:43,484 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} is VALID [2019-02-28 13:45:43,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} assume a[x] == 0; {12#(= (select main_a main_y) 1000)} is VALID [2019-02-28 13:45:43,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {10#false} is VALID [2019-02-28 13:45:43,492 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 13:45:43,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:45:43,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:45:43,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:45:43,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:45:43,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:45:43,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:45:43,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:45:43,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:45:43,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:45:43,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:45:43,533 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-02-28 13:45:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:45:43,775 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-28 13:45:43,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:45:43,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:45:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:45:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:45:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-02-28 13:45:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:45:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-02-28 13:45:43,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2019-02-28 13:45:43,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:45:43,897 INFO L225 Difference]: With dead ends: 15 [2019-02-28 13:45:43,897 INFO L226 Difference]: Without dead ends: 5 [2019-02-28 13:45:43,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:45:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-28 13:45:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-28 13:45:44,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:45:44,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-28 13:45:44,003 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:45:44,003 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:45:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:45:44,005 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:45:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:45:44,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:45:44,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:45:44,005 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:45:44,005 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:45:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:45:44,007 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:45:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:45:44,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:45:44,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:45:44,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:45:44,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:45:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:45:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-28 13:45:44,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-28 13:45:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:45:44,011 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-28 13:45:44,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:45:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:45:44,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:45:44,012 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:45:44,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:45:44,012 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:45:44,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:45:44,013 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-02-28 13:45:44,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:45:44,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:44,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:45:44,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:44,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:45:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:45:44,308 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-02-28 13:45:44,336 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} is VALID [2019-02-28 13:45:44,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {52#(= (select main_a main_x) 1000)} is VALID [2019-02-28 13:45:44,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(= (select main_a main_x) 1000)} assume a[x] == 0; {50#false} is VALID [2019-02-28 13:45:44,340 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-02-28 13:45:44,340 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 13:45:44,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:45:44,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:45:44,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:45:44,344 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-02-28 13:45:44,396 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:45:44,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:45:49,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:45:49,395 INFO L272 AbstractInterpreter]: Visited 4 different actions 9 times. Merged at 3 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 13:45:49,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:45:49,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:45:49,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:45:49,402 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:45:49,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:45:49,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:45:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:45:49,423 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 13:45:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:45:49,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:45:49,487 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-28 13:45:49,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:49,519 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-28 13:45:49,523 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:45:49,531 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:45:49,538 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:45:49,539 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-02-28 13:45:49,541 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:45:49,542 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_11]. (and (= main_a (store (store v_main_a_11 main_x 1000) main_y 0)) (= main_y (+ main_x 1))) [2019-02-28 13:45:49,542 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-02-28 13:45:49,633 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:49,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:49,652 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 45 [2019-02-28 13:45:49,754 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:49,769 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:49,775 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:49,779 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-02-28 13:45:49,782 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:45:49,840 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:49,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:49,845 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:49,849 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:49,852 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:49,870 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2019-02-28 13:45:49,872 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:45:49,902 INFO L315 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-28 13:45:50,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:50,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:50,027 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 44 [2019-02-28 13:45:50,054 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:50,056 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:50,069 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:50,071 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2019-02-28 13:45:50,089 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:45:50,155 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:50,186 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:50,187 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:50,189 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:50,191 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:45:50,197 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-02-28 13:45:50,202 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 13:45:50,228 INFO L315 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-28 13:45:50,284 INFO L315 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-02-28 13:45:50,328 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-28 13:45:50,328 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:42, output treesize:72 [2019-02-28 13:50:01,728 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:50:01,729 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_12, main_xold, main_yold]. (let ((.cse0 (+ main_xold 1)) (.cse2 (select v_main_a_12 main_xold))) (and (= (select v_main_a_12 .cse0) 0) (= main_x (mod .cse0 256)) (= (let ((.cse1 (store v_main_a_12 main_x .cse2))) (store .cse1 (mod (+ main_xold 2) 256) (select .cse1 main_yold))) main_a) (= .cse2 1000))) [2019-02-28 13:50:01,729 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_4]. (let ((.cse1 (select main_a main_x))) (or (let ((.cse0 (select main_a (+ main_x (- 1))))) (and (= main_x (mod main_x 256)) (= 1000 .cse0) (= (select main_a (mod (+ main_x 1) 256)) (select main_a v_prenex_4)) (= .cse1 .cse0))) (let ((.cse2 (select main_a main_xold)) (.cse3 (+ main_xold 1))) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= .cse1 .cse2) (= 0 (select main_a .cse3)) (= .cse2 1000) (= main_x (mod .cse3 256)))))) [2019-02-28 13:50:09,390 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-02-28 13:53:29,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2019-02-28 13:53:29,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} assume a[x] == 0; {50#false} is VALID [2019-02-28 13:53:29,530 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-02-28 13:53:29,530 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 13:53:29,530 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:53:29,618 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-02-28 13:53:29,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#(not (= (select main_a main_x) 0))} assume a[x] == 0; {50#false} is VALID [2019-02-28 13:53:29,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {70#(not (= (select main_a main_x) 0))} is VALID [2019-02-28 13:53:29,623 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} is VALID [2019-02-28 13:53:29,624 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 13:53:29,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:53:29,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-28 13:53:29,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:53:29,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-28 13:53:29,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:53:29,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-28 13:56:49,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 6 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-02-28 13:56:49,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 13:56:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 13:56:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 13:56:49,879 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states.