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_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 13:47:13,390 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:47:13,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:47:13,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:47:13,413 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:47:13,414 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:47:13,415 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:47:13,417 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:47:13,418 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:47:13,419 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:47:13,420 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:47:13,420 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:47:13,421 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:47:13,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:47:13,424 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:47:13,424 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:47:13,427 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:47:13,429 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:47:13,431 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:47:13,438 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:47:13,439 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:47:13,440 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:47:13,443 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:47:13,443 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:47:13,444 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:47:13,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:47:13,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:47:13,446 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:47:13,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:47:13,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:47:13,449 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:47:13,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:47:13,450 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:47:13,450 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:47:13,451 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:47:13,452 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:47:13,452 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-24 13:47:13,477 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:47:13,478 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:47:13,479 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:47:13,479 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:47:13,479 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:47:13,479 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:47:13,479 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:47:13,480 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:47:13,480 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:47:13,480 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:47:13,480 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:47:13,480 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:47:13,481 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:47:13,481 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:47:13,481 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:47:13,482 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:47:13,482 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:47:13,482 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:47:13,482 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:47:13,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:47:13,483 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:47:13,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:47:13,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:47:13,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:47:13,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:47:13,484 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:47:13,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:47:13,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:47:13,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:47:13,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:47:13,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:47:13,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:47:13,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:47:13,485 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:47:13,485 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:47:13,486 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:47:13,488 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:47:13,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:47:13,488 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:47:13,488 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:47:13,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:47:13,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:47:13,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:47:13,547 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:47:13,548 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:47:13,549 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2018-12-24 13:47:13,549 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2018-12-24 13:47:13,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:47:13,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:47:13,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:47:13,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:47:13,617 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:47:13,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:13,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:13,661 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-24 13:47:13,661 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-24 13:47:13,661 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-24 13:47:13,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:47:13,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:47:13,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:47:13,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:47:13,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:13,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:13,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:13,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:13,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:13,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:13,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:13,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:47:13,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:47:13,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:47:13,717 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:47:13,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:47:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-24 13:47:13,794 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-24 13:47:13,794 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-12-24 13:47:14,023 INFO L272 CfgBuilder]: Using library mode [2018-12-24 13:47:14,024 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-24 13:47:14,024 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:47:14 BoogieIcfgContainer [2018-12-24 13:47:14,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:47:14,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:47:14,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:47:14,029 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:47:14,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/2) ... [2018-12-24 13:47:14,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c1e120 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:47:14, skipping insertion in model container [2018-12-24 13:47:14,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:47:14" (2/2) ... [2018-12-24 13:47:14,033 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2018-12-24 13:47:14,044 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:47:14,053 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 13:47:14,088 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 13:47:14,157 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:47:14,157 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:47:14,158 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:47:14,158 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:47:14,158 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:47:14,158 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:47:14,158 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:47:14,159 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:47:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-12-24 13:47:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:47:14,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:14,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:47:14,189 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-12-24 13:47:14,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:14,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:14,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:14,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:14,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:14,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:47:14,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:47:14,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:47:14,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:47:14,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:47:14,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:47:14,505 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-12-24 13:47:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:14,593 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-24 13:47:14,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:47:14,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-24 13:47:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:14,607 INFO L225 Difference]: With dead ends: 17 [2018-12-24 13:47:14,607 INFO L226 Difference]: Without dead ends: 10 [2018-12-24 13:47:14,611 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 [2018-12-24 13:47:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-24 13:47:14,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-12-24 13:47:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 13:47:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-24 13:47:14,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-12-24 13:47:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:14,646 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-24 13:47:14,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:47:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-24 13:47:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:47:14,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:14,648 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-24 13:47:14,648 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:14,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-12-24 13:47:14,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:14,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:14,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:14,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:14,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:14,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:14,829 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:47:14,831 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2018-12-24 13:47:14,884 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:47:14,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:47:15,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:47:15,018 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 5 different actions 10 times. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:47:15,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:15,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:47:15,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:15,026 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 [2018-12-24 13:47:15,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:15,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:15,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:15,133 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:15,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:15,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:15,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:15,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:15,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:15,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:47:15,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:15,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:47:15,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:47:15,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:47:15,388 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-12-24 13:47:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:15,517 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-24 13:47:15,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:47:15,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-12-24 13:47:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:15,518 INFO L225 Difference]: With dead ends: 15 [2018-12-24 13:47:15,518 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 13:47:15,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:47:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 13:47:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-24 13:47:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 13:47:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-24 13:47:15,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-12-24 13:47:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:15,524 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-24 13:47:15,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:47:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-24 13:47:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-24 13:47:15,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:15,526 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-12-24 13:47:15,526 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:15,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:15,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-12-24 13:47:15,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:15,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:15,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:15,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:15,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:15,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:15,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:15,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:15,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:15,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:15,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:15,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:15,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:15,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:47:15,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:15,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:15,809 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:15,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:15,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:15,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:15,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:16,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:47:16,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:16,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:47:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:47:16,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:47:16,067 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-12-24 13:47:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:16,203 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-24 13:47:16,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:47:16,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-24 13:47:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:16,205 INFO L225 Difference]: With dead ends: 19 [2018-12-24 13:47:16,205 INFO L226 Difference]: Without dead ends: 18 [2018-12-24 13:47:16,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:47:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-24 13:47:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-24 13:47:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 13:47:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-24 13:47:16,212 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-12-24 13:47:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:16,213 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-24 13:47:16,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:47:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-24 13:47:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-24 13:47:16,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:16,214 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-12-24 13:47:16,214 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:16,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:16,215 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-12-24 13:47:16,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:16,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:16,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:16,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:16,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:16,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:16,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:16,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:16,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:16,362 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:16,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:16,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:16,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:16,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:47:16,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:16,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:47:16,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:47:16,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:47:16,610 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-12-24 13:47:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:16,959 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-24 13:47:16,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:47:16,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-24 13:47:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:16,961 INFO L225 Difference]: With dead ends: 23 [2018-12-24 13:47:16,961 INFO L226 Difference]: Without dead ends: 22 [2018-12-24 13:47:16,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:47:16,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-24 13:47:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-24 13:47:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-24 13:47:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-24 13:47:16,967 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-12-24 13:47:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:16,967 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-24 13:47:16,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:47:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-24 13:47:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-24 13:47:16,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:16,968 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-12-24 13:47:16,968 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-12-24 13:47:16,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:16,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:16,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:17,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:17,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:17,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:17,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:17,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:17,131 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-12-24 13:47:17,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:17,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:17,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:17,200 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:17,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:17,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:17,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:17,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:17,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:17,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:47:17,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:17,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:47:17,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:47:17,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:47:17,669 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-12-24 13:47:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:17,755 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-24 13:47:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:47:17,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-12-24 13:47:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:17,757 INFO L225 Difference]: With dead ends: 27 [2018-12-24 13:47:17,757 INFO L226 Difference]: Without dead ends: 26 [2018-12-24 13:47:17,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:47:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-24 13:47:17,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-24 13:47:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-24 13:47:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-24 13:47:17,762 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-12-24 13:47:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:17,763 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-24 13:47:17,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:47:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-24 13:47:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-24 13:47:17,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:17,764 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-12-24 13:47:17,764 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:17,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-12-24 13:47:17,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:17,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:17,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:17,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:17,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:17,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:17,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:17,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:17,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:17,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:17,922 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:17,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:17,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:17,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-24 13:47:17,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:17,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:17,958 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:17,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:17,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:17,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:18,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-24 13:47:18,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:18,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 13:47:18,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 13:47:18,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:47:18,306 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-12-24 13:47:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:18,371 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-24 13:47:18,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:47:18,371 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-24 13:47:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:18,373 INFO L225 Difference]: With dead ends: 31 [2018-12-24 13:47:18,373 INFO L226 Difference]: Without dead ends: 30 [2018-12-24 13:47:18,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:47:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-24 13:47:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-24 13:47:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-24 13:47:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-24 13:47:18,380 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-12-24 13:47:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:18,380 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-24 13:47:18,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 13:47:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-24 13:47:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-24 13:47:18,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:18,381 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-12-24 13:47:18,382 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-12-24 13:47:18,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:18,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:18,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:18,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:18,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:18,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:18,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:18,633 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:18,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:18,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:18,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:18,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:18,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:18,669 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:18,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:18,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:18,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:18,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-24 13:47:18,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:18,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-24 13:47:18,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-24 13:47:18,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-24 13:47:18,976 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-12-24 13:47:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:19,055 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-24 13:47:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:47:19,061 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-12-24 13:47:19,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:19,062 INFO L225 Difference]: With dead ends: 35 [2018-12-24 13:47:19,062 INFO L226 Difference]: Without dead ends: 34 [2018-12-24 13:47:19,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-24 13:47:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-24 13:47:19,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-24 13:47:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-24 13:47:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-24 13:47:19,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-12-24 13:47:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:19,069 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-24 13:47:19,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-24 13:47:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-24 13:47:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-24 13:47:19,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:19,070 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-12-24 13:47:19,071 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:19,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:19,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-12-24 13:47:19,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:19,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:19,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:19,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:19,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:19,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:19,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:19,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:19,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:19,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:19,297 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:19,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:19,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:19,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:19,331 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:19,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:19,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:19,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:19,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:19,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:19,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2018-12-24 13:47:19,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:19,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-24 13:47:19,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-24 13:47:19,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-24 13:47:19,946 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-12-24 13:47:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:20,207 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-24 13:47:20,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:47:20,208 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-12-24 13:47:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:20,209 INFO L225 Difference]: With dead ends: 39 [2018-12-24 13:47:20,209 INFO L226 Difference]: Without dead ends: 38 [2018-12-24 13:47:20,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-24 13:47:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-24 13:47:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-12-24 13:47:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 13:47:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-24 13:47:20,215 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-12-24 13:47:20,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:20,215 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-24 13:47:20,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-24 13:47:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-24 13:47:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-24 13:47:20,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:20,217 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-12-24 13:47:20,217 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:20,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:20,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-12-24 13:47:20,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:20,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:20,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:20,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:20,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:20,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:20,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:20,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:20,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:20,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:20,381 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:20,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:20,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:20,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-24 13:47:20,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:20,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:20,424 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:20,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:20,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:20,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:20,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:21,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:21,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2018-12-24 13:47:21,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:21,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-24 13:47:21,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-24 13:47:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-24 13:47:21,101 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-12-24 13:47:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:21,208 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-24 13:47:21,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 13:47:21,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-12-24 13:47:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:21,210 INFO L225 Difference]: With dead ends: 43 [2018-12-24 13:47:21,211 INFO L226 Difference]: Without dead ends: 42 [2018-12-24 13:47:21,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-24 13:47:21,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-24 13:47:21,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-24 13:47:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 13:47:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-24 13:47:21,218 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-12-24 13:47:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:21,218 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-24 13:47:21,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-24 13:47:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-24 13:47:21,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-24 13:47:21,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:21,220 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-12-24 13:47:21,220 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:21,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-12-24 13:47:21,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:21,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:21,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:21,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:21,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:21,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:21,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:21,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:21,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:21,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:21,553 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:21,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:21,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:21,579 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:21,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:21,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:21,591 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:21,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:21,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:21,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:21,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:22,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:22,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-24 13:47:22,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:22,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-24 13:47:22,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-24 13:47:22,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-24 13:47:22,159 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-12-24 13:47:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:22,242 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-24 13:47:22,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 13:47:22,242 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-12-24 13:47:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:22,244 INFO L225 Difference]: With dead ends: 47 [2018-12-24 13:47:22,244 INFO L226 Difference]: Without dead ends: 46 [2018-12-24 13:47:22,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-24 13:47:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-24 13:47:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-12-24 13:47:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-24 13:47:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-24 13:47:22,252 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-12-24 13:47:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:22,253 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-24 13:47:22,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-24 13:47:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-24 13:47:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-24 13:47:22,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:22,254 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-12-24 13:47:22,255 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:22,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:22,255 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-12-24 13:47:22,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:22,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:22,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:22,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:22,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:22,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:22,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:22,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:22,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:22,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:22,641 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:22,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:22,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:22,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:22,700 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:22,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:22,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:22,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:22,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:23,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:23,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2018-12-24 13:47:23,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:23,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-24 13:47:23,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-24 13:47:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-24 13:47:23,185 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-12-24 13:47:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:23,263 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-24 13:47:23,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 13:47:23,263 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-12-24 13:47:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:23,265 INFO L225 Difference]: With dead ends: 51 [2018-12-24 13:47:23,265 INFO L226 Difference]: Without dead ends: 50 [2018-12-24 13:47:23,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-24 13:47:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-24 13:47:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-24 13:47:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-24 13:47:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-24 13:47:23,271 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-12-24 13:47:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:23,271 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-24 13:47:23,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-24 13:47:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-24 13:47:23,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-24 13:47:23,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:23,272 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-12-24 13:47:23,272 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:23,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:23,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-12-24 13:47:23,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:23,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:23,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:23,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:23,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:23,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:23,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:23,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:23,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:23,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:23,512 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:23,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:23,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:23,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-24 13:47:23,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:23,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:23,574 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:23,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:23,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:23,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:23,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:24,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:24,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2018-12-24 13:47:24,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:24,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-24 13:47:24,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-24 13:47:24,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 13:47:24,097 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-12-24 13:47:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:24,204 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-24 13:47:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-24 13:47:24,205 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-12-24 13:47:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:24,206 INFO L225 Difference]: With dead ends: 55 [2018-12-24 13:47:24,206 INFO L226 Difference]: Without dead ends: 54 [2018-12-24 13:47:24,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 13:47:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-24 13:47:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-12-24 13:47:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-24 13:47:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-24 13:47:24,213 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-12-24 13:47:24,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:24,213 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-24 13:47:24,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-24 13:47:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-24 13:47:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-24 13:47:24,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:24,215 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-12-24 13:47:24,215 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-12-24 13:47:24,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:24,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:24,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:24,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:24,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:24,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:24,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:24,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:24,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:24,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:24,671 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:24,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:24,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:24,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:24,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:24,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:24,712 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:24,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:24,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:24,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:25,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:25,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:25,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2018-12-24 13:47:25,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:25,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-24 13:47:25,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-24 13:47:25,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-24 13:47:25,496 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-12-24 13:47:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:25,592 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-24 13:47:25,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-24 13:47:25,592 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-12-24 13:47:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:25,593 INFO L225 Difference]: With dead ends: 59 [2018-12-24 13:47:25,593 INFO L226 Difference]: Without dead ends: 58 [2018-12-24 13:47:25,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-24 13:47:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-24 13:47:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-24 13:47:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-24 13:47:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-24 13:47:25,600 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-12-24 13:47:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:25,600 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-24 13:47:25,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-24 13:47:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-24 13:47:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-24 13:47:25,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:25,602 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-12-24 13:47:25,602 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-12-24 13:47:25,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:25,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:25,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:25,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:25,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:25,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:25,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:25,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:25,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:25,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:25,980 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:25,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:25,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:26,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:26,021 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:26,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:26,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:26,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:26,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:27,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:27,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2018-12-24 13:47:27,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:27,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-24 13:47:27,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-24 13:47:27,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 13:47:27,138 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-12-24 13:47:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:27,403 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-24 13:47:27,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-24 13:47:27,404 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-12-24 13:47:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:27,405 INFO L225 Difference]: With dead ends: 63 [2018-12-24 13:47:27,405 INFO L226 Difference]: Without dead ends: 62 [2018-12-24 13:47:27,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 13:47:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-24 13:47:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-24 13:47:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 13:47:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-24 13:47:27,412 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-12-24 13:47:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:27,413 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-24 13:47:27,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-24 13:47:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-24 13:47:27,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-24 13:47:27,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:27,414 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-12-24 13:47:27,414 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:27,415 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-12-24 13:47:27,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:27,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:27,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:27,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:27,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:27,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:27,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:27,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:27,653 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:27,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:27,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:27,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-24 13:47:27,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:27,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:27,718 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:27,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:27,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:27,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:28,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:28,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:28,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2018-12-24 13:47:28,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:28,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-24 13:47:28,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-24 13:47:28,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-24 13:47:28,657 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-12-24 13:47:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:28,892 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-24 13:47:28,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-24 13:47:28,893 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-12-24 13:47:28,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:28,894 INFO L225 Difference]: With dead ends: 67 [2018-12-24 13:47:28,894 INFO L226 Difference]: Without dead ends: 66 [2018-12-24 13:47:28,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-24 13:47:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-24 13:47:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-12-24 13:47:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-24 13:47:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-24 13:47:28,902 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-12-24 13:47:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:28,902 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-24 13:47:28,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-24 13:47:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-24 13:47:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-24 13:47:28,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:28,904 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-12-24 13:47:28,904 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:28,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:28,904 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-12-24 13:47:28,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:28,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:28,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:28,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:29,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:29,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:29,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:29,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:29,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:29,848 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:29,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:29,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:29,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:29,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:29,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:29,901 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:29,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:29,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:29,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:30,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:30,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:30,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2018-12-24 13:47:30,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:30,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-24 13:47:30,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-24 13:47:30,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 13:47:30,619 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-12-24 13:47:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:30,747 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-24 13:47:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-24 13:47:30,748 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-12-24 13:47:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:30,749 INFO L225 Difference]: With dead ends: 71 [2018-12-24 13:47:30,749 INFO L226 Difference]: Without dead ends: 70 [2018-12-24 13:47:30,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 13:47:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-24 13:47:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-12-24 13:47:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-24 13:47:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-24 13:47:30,756 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-12-24 13:47:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:30,756 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-24 13:47:30,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-24 13:47:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-24 13:47:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-24 13:47:30,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:30,757 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-12-24 13:47:30,757 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-12-24 13:47:30,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:30,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:30,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:30,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:30,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:31,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:31,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:31,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:31,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:31,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:31,012 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:31,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:31,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:31,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:31,069 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:31,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:31,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:31,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:31,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:33,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:33,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2018-12-24 13:47:33,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:33,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-24 13:47:33,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-24 13:47:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-24 13:47:33,346 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-12-24 13:47:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:33,444 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-24 13:47:33,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-24 13:47:33,445 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-12-24 13:47:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:33,445 INFO L225 Difference]: With dead ends: 75 [2018-12-24 13:47:33,446 INFO L226 Difference]: Without dead ends: 74 [2018-12-24 13:47:33,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-24 13:47:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-24 13:47:33,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-12-24 13:47:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 13:47:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-24 13:47:33,452 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-12-24 13:47:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:33,453 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-24 13:47:33,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-24 13:47:33,453 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-24 13:47:33,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-24 13:47:33,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:33,454 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-12-24 13:47:33,454 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:33,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:33,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-12-24 13:47:33,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:33,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:33,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:33,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:33,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:33,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:33,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:33,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:33,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:33,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:33,728 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:33,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:33,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:33,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-24 13:47:33,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:33,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:33,803 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:33,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:33,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:33,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:34,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:34,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:34,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2018-12-24 13:47:34,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:34,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-24 13:47:34,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-24 13:47:34,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 13:47:34,536 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-12-24 13:47:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:34,694 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-24 13:47:34,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-24 13:47:34,699 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-12-24 13:47:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:34,700 INFO L225 Difference]: With dead ends: 79 [2018-12-24 13:47:34,700 INFO L226 Difference]: Without dead ends: 78 [2018-12-24 13:47:34,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 13:47:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-24 13:47:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-12-24 13:47:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 13:47:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-24 13:47:34,705 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-12-24 13:47:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:34,706 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-24 13:47:34,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-24 13:47:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-24 13:47:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-24 13:47:34,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:34,707 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-12-24 13:47:34,707 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:34,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:34,708 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-12-24 13:47:34,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:34,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:34,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:34,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:35,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:35,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:35,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:35,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:35,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:35,195 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:35,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:35,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:35,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:35,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:35,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:35,231 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:35,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:35,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:35,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:35,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:36,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:36,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2018-12-24 13:47:36,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:36,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-24 13:47:36,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-24 13:47:36,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-24 13:47:36,495 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-12-24 13:47:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:36,662 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-24 13:47:36,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-24 13:47:36,662 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-12-24 13:47:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:36,663 INFO L225 Difference]: With dead ends: 83 [2018-12-24 13:47:36,663 INFO L226 Difference]: Without dead ends: 82 [2018-12-24 13:47:36,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-24 13:47:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-24 13:47:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-12-24 13:47:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-24 13:47:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-24 13:47:36,673 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-12-24 13:47:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:36,673 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-24 13:47:36,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-24 13:47:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-24 13:47:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-24 13:47:36,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:36,674 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-12-24 13:47:36,675 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:36,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:36,675 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-12-24 13:47:36,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:36,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:36,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:36,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:36,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:37,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:37,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:37,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:37,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:37,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:37,076 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:37,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:37,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:37,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:37,113 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:37,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:37,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:37,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:37,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:38,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:38,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2018-12-24 13:47:38,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:38,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-24 13:47:38,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-24 13:47:38,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 13:47:38,152 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-12-24 13:47:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:38,284 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-24 13:47:38,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-24 13:47:38,285 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-12-24 13:47:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:38,286 INFO L225 Difference]: With dead ends: 87 [2018-12-24 13:47:38,286 INFO L226 Difference]: Without dead ends: 86 [2018-12-24 13:47:38,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 13:47:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-24 13:47:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-12-24 13:47:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-24 13:47:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-24 13:47:38,292 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-12-24 13:47:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:38,293 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-24 13:47:38,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-24 13:47:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-24 13:47:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-24 13:47:38,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:38,294 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-12-24 13:47:38,294 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:38,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:38,294 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-12-24 13:47:38,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:38,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:38,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:39,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:39,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:39,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:39,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:39,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:39,143 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:39,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:39,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:39,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-24 13:47:39,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:39,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:39,210 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:39,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:39,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:39,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:39,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:40,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:40,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2018-12-24 13:47:40,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:40,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-24 13:47:40,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-24 13:47:40,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-24 13:47:40,494 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-12-24 13:47:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:40,653 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-24 13:47:40,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-24 13:47:40,653 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-12-24 13:47:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:40,655 INFO L225 Difference]: With dead ends: 91 [2018-12-24 13:47:40,655 INFO L226 Difference]: Without dead ends: 90 [2018-12-24 13:47:40,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-24 13:47:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-24 13:47:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-12-24 13:47:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-24 13:47:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-24 13:47:40,660 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-12-24 13:47:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:40,660 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-24 13:47:40,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-24 13:47:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-24 13:47:40,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-24 13:47:40,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:40,661 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-12-24 13:47:40,662 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:40,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:40,662 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-12-24 13:47:40,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:40,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:40,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:40,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:40,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:41,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:41,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:41,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:41,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:41,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:41,214 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:41,229 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:41,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:41,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:41,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:41,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:41,299 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:41,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:41,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:41,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:41,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:42,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:42,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-24 13:47:42,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:42,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-24 13:47:42,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-24 13:47:42,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 13:47:42,460 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-12-24 13:47:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:42,648 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-24 13:47:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-24 13:47:42,651 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-12-24 13:47:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:42,652 INFO L225 Difference]: With dead ends: 95 [2018-12-24 13:47:42,652 INFO L226 Difference]: Without dead ends: 94 [2018-12-24 13:47:42,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 13:47:42,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-24 13:47:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-12-24 13:47:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-24 13:47:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-24 13:47:42,656 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-12-24 13:47:42,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:42,656 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-24 13:47:42,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-24 13:47:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-24 13:47:42,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-24 13:47:42,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:42,657 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-12-24 13:47:42,657 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:42,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:42,657 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-12-24 13:47:42,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:42,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:42,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:42,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:42,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:43,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:43,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:43,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:43,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:43,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:43,050 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:43,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:43,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:43,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:43,090 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:43,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:43,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:43,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:43,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:44,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:44,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2018-12-24 13:47:44,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:44,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-24 13:47:44,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-24 13:47:44,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-24 13:47:44,260 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-12-24 13:47:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:44,403 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-24 13:47:44,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-24 13:47:44,407 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-12-24 13:47:44,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:44,408 INFO L225 Difference]: With dead ends: 99 [2018-12-24 13:47:44,408 INFO L226 Difference]: Without dead ends: 98 [2018-12-24 13:47:44,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-24 13:47:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-24 13:47:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-12-24 13:47:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 13:47:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-24 13:47:44,412 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-12-24 13:47:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:44,413 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-24 13:47:44,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-24 13:47:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-24 13:47:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-24 13:47:44,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:44,414 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-12-24 13:47:44,414 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:44,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-12-24 13:47:44,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:44,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:44,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:44,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:44,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:44,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:44,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:44,826 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:44,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:44,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:44,826 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:44,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:44,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:44,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-24 13:47:44,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:44,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:44,903 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:44,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:44,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:44,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:45,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:46,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:46,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2018-12-24 13:47:46,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:46,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-24 13:47:46,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-24 13:47:46,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 13:47:46,521 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-12-24 13:47:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:46,736 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-24 13:47:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-24 13:47:46,737 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-12-24 13:47:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:46,738 INFO L225 Difference]: With dead ends: 103 [2018-12-24 13:47:46,738 INFO L226 Difference]: Without dead ends: 102 [2018-12-24 13:47:46,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 13:47:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-24 13:47:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-12-24 13:47:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-24 13:47:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-24 13:47:46,744 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-12-24 13:47:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:46,745 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-24 13:47:46,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-24 13:47:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-24 13:47:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-24 13:47:46,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:46,746 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-12-24 13:47:46,746 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:46,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:46,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-12-24 13:47:46,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:46,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:46,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:46,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:46,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:47,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:47,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:47,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:47,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:47,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:47,407 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:47,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:47,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:47,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:47,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:47,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:47,453 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:47,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:47,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:47,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:47,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:48,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:48,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2018-12-24 13:47:48,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:48,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-24 13:47:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-24 13:47:48,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-24 13:47:48,785 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-12-24 13:47:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:48,971 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-24 13:47:48,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-24 13:47:48,972 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-12-24 13:47:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:48,973 INFO L225 Difference]: With dead ends: 107 [2018-12-24 13:47:48,973 INFO L226 Difference]: Without dead ends: 106 [2018-12-24 13:47:48,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-24 13:47:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-24 13:47:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-12-24 13:47:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-24 13:47:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-24 13:47:48,978 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-12-24 13:47:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:48,979 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-24 13:47:48,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-24 13:47:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-24 13:47:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-24 13:47:48,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:48,980 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-12-24 13:47:48,980 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:48,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-12-24 13:47:48,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:48,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:48,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:48,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:48,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:49,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:49,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:49,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:49,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:49,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:49,925 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:49,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:49,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:49,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:49,966 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:49,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:49,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:49,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:50,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:51,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:51,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2018-12-24 13:47:51,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:51,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-24 13:47:51,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-24 13:47:51,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 13:47:51,548 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-12-24 13:47:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:51,707 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-24 13:47:51,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-24 13:47:51,708 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-12-24 13:47:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:51,709 INFO L225 Difference]: With dead ends: 111 [2018-12-24 13:47:51,709 INFO L226 Difference]: Without dead ends: 110 [2018-12-24 13:47:51,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 13:47:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-24 13:47:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-12-24 13:47:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-24 13:47:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-24 13:47:51,715 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-12-24 13:47:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:51,715 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-24 13:47:51,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-24 13:47:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-24 13:47:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-24 13:47:51,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:51,716 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-12-24 13:47:51,716 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-12-24 13:47:51,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:51,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:51,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:51,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:51,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:52,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:52,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:52,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:52,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:52,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:52,195 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:52,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:52,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:52,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-24 13:47:52,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:52,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:52,293 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:52,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:52,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:52,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:52,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:53,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:53,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2018-12-24 13:47:53,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:53,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-24 13:47:53,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-24 13:47:53,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-24 13:47:53,793 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-12-24 13:47:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:53,971 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-24 13:47:53,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-24 13:47:53,971 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-12-24 13:47:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:53,973 INFO L225 Difference]: With dead ends: 115 [2018-12-24 13:47:53,973 INFO L226 Difference]: Without dead ends: 114 [2018-12-24 13:47:53,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-24 13:47:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-24 13:47:53,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-12-24 13:47:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-24 13:47:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-24 13:47:53,979 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-12-24 13:47:53,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:53,979 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-24 13:47:53,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-24 13:47:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-24 13:47:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-24 13:47:53,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:53,980 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-12-24 13:47:53,980 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:53,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:53,981 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-12-24 13:47:53,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:53,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:53,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:53,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:53,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:54,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:54,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:54,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:54,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:54,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:54,623 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:54,633 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:54,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:54,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:54,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:54,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:54,686 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:54,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:54,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:54,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:55,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:56,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:56,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-24 13:47:56,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:56,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-24 13:47:56,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-24 13:47:56,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 13:47:56,549 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-12-24 13:47:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:56,737 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-12-24 13:47:56,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-24 13:47:56,738 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-12-24 13:47:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:56,739 INFO L225 Difference]: With dead ends: 119 [2018-12-24 13:47:56,739 INFO L226 Difference]: Without dead ends: 118 [2018-12-24 13:47:56,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 13:47:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-24 13:47:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-12-24 13:47:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-24 13:47:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-12-24 13:47:56,744 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-12-24 13:47:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:56,744 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-12-24 13:47:56,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-24 13:47:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-12-24 13:47:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-24 13:47:56,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:56,745 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-12-24 13:47:56,745 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:56,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-12-24 13:47:56,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:56,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:56,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:56,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:56,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:57,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:57,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:57,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:57,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:57,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:57,359 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:57,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:57,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:57,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:57,412 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:57,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:57,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:57,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:58,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:59,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:59,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2018-12-24 13:47:59,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:59,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-24 13:47:59,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-24 13:47:59,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-24 13:47:59,277 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-12-24 13:47:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:59,487 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-12-24 13:47:59,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-24 13:47:59,488 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-12-24 13:47:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:59,489 INFO L225 Difference]: With dead ends: 123 [2018-12-24 13:47:59,489 INFO L226 Difference]: Without dead ends: 122 [2018-12-24 13:47:59,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-24 13:47:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-24 13:47:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-12-24 13:47:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-24 13:47:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-12-24 13:47:59,495 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-12-24 13:47:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:59,495 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-12-24 13:47:59,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-24 13:47:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-12-24 13:47:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-24 13:47:59,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:59,496 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-12-24 13:47:59,497 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:59,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:59,497 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-12-24 13:47:59,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:59,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:59,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:59,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:59,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:00,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:00,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:00,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:00,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:00,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:00,224 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:00,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:00,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:00,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-24 13:48:00,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:00,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:00,357 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:00,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:00,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:00,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:01,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:02,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:02,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2018-12-24 13:48:02,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:02,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-24 13:48:02,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-24 13:48:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 13:48:02,384 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-12-24 13:48:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:02,605 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-12-24 13:48:02,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-24 13:48:02,606 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-12-24 13:48:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:02,607 INFO L225 Difference]: With dead ends: 127 [2018-12-24 13:48:02,607 INFO L226 Difference]: Without dead ends: 126 [2018-12-24 13:48:02,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 13:48:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-24 13:48:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-12-24 13:48:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-24 13:48:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-12-24 13:48:02,613 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-12-24 13:48:02,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:02,613 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-12-24 13:48:02,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-24 13:48:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-12-24 13:48:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-24 13:48:02,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:02,614 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-12-24 13:48:02,614 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-12-24 13:48:02,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:02,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:02,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:03,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:03,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:03,348 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:03,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:03,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:03,348 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:03,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:03,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:03,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:03,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:03,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:03,401 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:03,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:03,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:03,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:04,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:05,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:05,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2018-12-24 13:48:05,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:05,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-24 13:48:05,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-24 13:48:05,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-24 13:48:05,273 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-12-24 13:48:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:05,516 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-12-24 13:48:05,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-24 13:48:05,516 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-12-24 13:48:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:05,518 INFO L225 Difference]: With dead ends: 131 [2018-12-24 13:48:05,518 INFO L226 Difference]: Without dead ends: 130 [2018-12-24 13:48:05,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-24 13:48:05,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-24 13:48:05,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-12-24 13:48:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-24 13:48:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-12-24 13:48:05,523 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-12-24 13:48:05,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:05,524 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-12-24 13:48:05,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-24 13:48:05,524 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-12-24 13:48:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-24 13:48:05,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:05,525 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-12-24 13:48:05,525 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:05,526 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-12-24 13:48:05,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:05,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:05,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:05,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:05,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:06,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:06,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:06,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:06,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:06,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:06,310 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:06,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:06,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:06,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:06,364 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:06,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:06,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:06,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:07,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:08,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:08,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2018-12-24 13:48:08,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:08,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-24 13:48:08,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-24 13:48:08,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 13:48:08,666 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-12-24 13:48:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:08,890 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-12-24 13:48:08,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-24 13:48:08,890 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-12-24 13:48:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:08,892 INFO L225 Difference]: With dead ends: 135 [2018-12-24 13:48:08,892 INFO L226 Difference]: Without dead ends: 134 [2018-12-24 13:48:08,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 13:48:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-24 13:48:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-12-24 13:48:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-24 13:48:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-12-24 13:48:08,898 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-12-24 13:48:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:08,898 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-12-24 13:48:08,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-24 13:48:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-12-24 13:48:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-24 13:48:08,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:08,900 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-12-24 13:48:08,900 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:08,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:08,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-12-24 13:48:08,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:08,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:08,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:08,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:08,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:09,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:09,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:09,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:09,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:09,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:09,610 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:09,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:09,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:09,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-24 13:48:09,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:09,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:09,778 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:09,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:09,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:09,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:11,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:12,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:12,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2018-12-24 13:48:12,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:12,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-24 13:48:12,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-24 13:48:12,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-24 13:48:12,619 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-12-24 13:48:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:12,842 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-12-24 13:48:12,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-24 13:48:12,842 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-12-24 13:48:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:12,844 INFO L225 Difference]: With dead ends: 139 [2018-12-24 13:48:12,844 INFO L226 Difference]: Without dead ends: 138 [2018-12-24 13:48:12,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-24 13:48:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-24 13:48:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-12-24 13:48:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-24 13:48:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-12-24 13:48:12,849 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-12-24 13:48:12,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:12,850 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-12-24 13:48:12,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-24 13:48:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-12-24 13:48:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-24 13:48:12,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:12,851 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-12-24 13:48:12,851 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-12-24 13:48:12,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:12,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:12,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:12,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:12,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:13,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:13,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:13,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:13,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:13,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:13,630 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:13,644 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:13,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:13,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:13,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:13,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:13,707 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:13,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:13,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:13,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:15,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:17,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:17,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-24 13:48:17,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:17,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-24 13:48:17,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-24 13:48:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 13:48:17,387 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-12-24 13:48:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:17,719 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-12-24 13:48:17,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-24 13:48:17,719 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-12-24 13:48:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:17,720 INFO L225 Difference]: With dead ends: 143 [2018-12-24 13:48:17,721 INFO L226 Difference]: Without dead ends: 142 [2018-12-24 13:48:17,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 13:48:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-24 13:48:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-12-24 13:48:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-24 13:48:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-12-24 13:48:17,725 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-12-24 13:48:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:17,726 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-12-24 13:48:17,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-24 13:48:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-12-24 13:48:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-24 13:48:17,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:17,727 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-12-24 13:48:17,727 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:17,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:17,728 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-12-24 13:48:17,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:17,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:17,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:17,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:17,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:19,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:19,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:19,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:19,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:19,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:19,056 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:19,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:19,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:19,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:19,110 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:19,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:19,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:19,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:20,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:22,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:22,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2018-12-24 13:48:22,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:22,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-24 13:48:22,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-24 13:48:22,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-24 13:48:22,218 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-12-24 13:48:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:22,648 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-12-24 13:48:22,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-24 13:48:22,649 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-12-24 13:48:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:22,650 INFO L225 Difference]: With dead ends: 147 [2018-12-24 13:48:22,650 INFO L226 Difference]: Without dead ends: 146 [2018-12-24 13:48:22,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-24 13:48:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-24 13:48:22,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-12-24 13:48:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-24 13:48:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-12-24 13:48:22,656 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-12-24 13:48:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:22,656 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-12-24 13:48:22,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-24 13:48:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-12-24 13:48:22,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-24 13:48:22,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:22,658 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-12-24 13:48:22,658 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:22,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:22,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-12-24 13:48:22,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:22,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:22,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:22,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:22,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:23,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:23,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:23,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:23,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:23,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:23,419 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:23,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:23,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:23,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-24 13:48:23,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:23,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:23,561 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:23,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:23,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:23,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:24,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:26,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:26,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2018-12-24 13:48:26,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:26,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-24 13:48:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-24 13:48:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 13:48:26,103 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-12-24 13:48:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:26,561 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-12-24 13:48:26,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-24 13:48:26,562 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-12-24 13:48:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:26,564 INFO L225 Difference]: With dead ends: 151 [2018-12-24 13:48:26,564 INFO L226 Difference]: Without dead ends: 150 [2018-12-24 13:48:26,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 13:48:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-24 13:48:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-12-24 13:48:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-24 13:48:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-12-24 13:48:26,570 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-12-24 13:48:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:26,570 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-12-24 13:48:26,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-24 13:48:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-12-24 13:48:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-24 13:48:26,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:26,572 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-12-24 13:48:26,572 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:26,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:26,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-12-24 13:48:26,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:26,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:26,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:30,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:30,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:30,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:30,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:30,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:30,382 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:30,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:30,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:30,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:30,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:30,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:30,482 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:30,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:30,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:30,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:31,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:33,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:33,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2018-12-24 13:48:33,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:33,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-24 13:48:33,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-24 13:48:33,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-24 13:48:33,483 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-12-24 13:48:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:33,821 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-12-24 13:48:33,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-24 13:48:33,822 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-12-24 13:48:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:33,824 INFO L225 Difference]: With dead ends: 155 [2018-12-24 13:48:33,824 INFO L226 Difference]: Without dead ends: 154 [2018-12-24 13:48:33,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-24 13:48:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-24 13:48:33,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-12-24 13:48:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-24 13:48:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-12-24 13:48:33,830 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-12-24 13:48:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:33,831 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-12-24 13:48:33,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-24 13:48:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-12-24 13:48:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-24 13:48:33,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:33,832 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-12-24 13:48:33,832 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:33,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:33,833 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-12-24 13:48:33,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:33,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:33,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:33,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:36,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:36,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:36,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:36,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:36,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:36,679 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:36,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:36,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:36,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:36,785 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:36,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:36,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:36,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:38,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:39,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:39,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2018-12-24 13:48:39,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:39,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-24 13:48:39,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-24 13:48:39,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 13:48:39,999 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-12-24 13:48:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:40,281 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-12-24 13:48:40,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-24 13:48:40,281 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-12-24 13:48:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:40,283 INFO L225 Difference]: With dead ends: 159 [2018-12-24 13:48:40,283 INFO L226 Difference]: Without dead ends: 158 [2018-12-24 13:48:40,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 13:48:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-24 13:48:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-12-24 13:48:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-24 13:48:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-12-24 13:48:40,288 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-12-24 13:48:40,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:40,288 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-12-24 13:48:40,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-24 13:48:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-12-24 13:48:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-24 13:48:40,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:40,289 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-12-24 13:48:40,289 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-12-24 13:48:40,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:40,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:40,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:40,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:40,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:41,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:41,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:41,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:41,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:41,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:41,347 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:41,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:41,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:41,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-24 13:48:41,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:41,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:41,499 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:41,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:41,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:41,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:42,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:44,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:44,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2018-12-24 13:48:44,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:44,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-24 13:48:44,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-24 13:48:44,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-24 13:48:44,591 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-12-24 13:48:44,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:44,888 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-12-24 13:48:44,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-24 13:48:44,889 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-12-24 13:48:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:44,890 INFO L225 Difference]: With dead ends: 163 [2018-12-24 13:48:44,890 INFO L226 Difference]: Without dead ends: 162 [2018-12-24 13:48:44,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-24 13:48:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-24 13:48:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-12-24 13:48:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-24 13:48:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-12-24 13:48:44,897 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-12-24 13:48:44,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:44,897 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-12-24 13:48:44,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-24 13:48:44,897 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-12-24 13:48:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-24 13:48:44,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:44,898 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-12-24 13:48:44,898 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:44,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:44,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-12-24 13:48:44,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:44,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:44,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:44,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:44,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:46,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:46,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:46,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:46,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:46,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:46,227 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:46,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:46,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:46,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:46,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:46,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:46,308 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:46,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:46,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:46,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:47,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:49,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:49,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-24 13:48:49,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:49,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-24 13:48:49,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-24 13:48:49,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 13:48:49,658 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-12-24 13:48:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:50,103 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-12-24 13:48:50,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-24 13:48:50,104 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-12-24 13:48:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:50,105 INFO L225 Difference]: With dead ends: 167 [2018-12-24 13:48:50,105 INFO L226 Difference]: Without dead ends: 166 [2018-12-24 13:48:50,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 13:48:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-24 13:48:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-12-24 13:48:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-24 13:48:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-12-24 13:48:50,112 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-12-24 13:48:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:50,113 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-12-24 13:48:50,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-24 13:48:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-12-24 13:48:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-24 13:48:50,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:50,114 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-12-24 13:48:50,114 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:50,115 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-12-24 13:48:50,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:50,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:50,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:50,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:50,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:51,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:51,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:51,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:51,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:51,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:51,196 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:51,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:51,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:51,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:51,269 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:51,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:51,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:51,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:52,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:54,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:54,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2018-12-24 13:48:54,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:54,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-24 13:48:54,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-24 13:48:54,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-24 13:48:54,879 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-12-24 13:48:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:55,151 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-12-24 13:48:55,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-24 13:48:55,152 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-12-24 13:48:55,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:55,153 INFO L225 Difference]: With dead ends: 171 [2018-12-24 13:48:55,153 INFO L226 Difference]: Without dead ends: 170 [2018-12-24 13:48:55,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-24 13:48:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-24 13:48:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-12-24 13:48:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-24 13:48:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-12-24 13:48:55,158 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-12-24 13:48:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:55,159 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-12-24 13:48:55,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-24 13:48:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-12-24 13:48:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-24 13:48:55,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:55,160 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-12-24 13:48:55,160 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:55,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:55,160 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-12-24 13:48:55,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:55,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:55,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:56,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:56,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:56,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:56,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:56,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:56,554 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:56,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:56,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:56,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-24 13:48:56,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:56,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:56,730 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:56,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:56,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:56,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:58,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:00,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:00,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2018-12-24 13:49:00,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:00,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-24 13:49:00,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-24 13:49:00,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 13:49:00,391 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-12-24 13:49:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:00,763 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-12-24 13:49:00,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-24 13:49:00,763 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-12-24 13:49:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:00,764 INFO L225 Difference]: With dead ends: 175 [2018-12-24 13:49:00,764 INFO L226 Difference]: Without dead ends: 174 [2018-12-24 13:49:00,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 13:49:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-24 13:49:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-12-24 13:49:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-24 13:49:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-12-24 13:49:00,771 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-12-24 13:49:00,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:00,771 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-12-24 13:49:00,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-24 13:49:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-12-24 13:49:00,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-24 13:49:00,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:00,772 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-12-24 13:49:00,772 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:00,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:00,773 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-12-24 13:49:00,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:00,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:00,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:00,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:00,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:01,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:01,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:01,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:01,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:01,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:01,784 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:01,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:01,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:01,841 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:01,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:01,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:01,849 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:01,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:01,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:01,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:03,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:05,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:05,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2018-12-24 13:49:05,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:05,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-24 13:49:05,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-24 13:49:05,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-24 13:49:05,743 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-12-24 13:49:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:06,337 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-12-24 13:49:06,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-24 13:49:06,337 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-12-24 13:49:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:06,339 INFO L225 Difference]: With dead ends: 179 [2018-12-24 13:49:06,339 INFO L226 Difference]: Without dead ends: 178 [2018-12-24 13:49:06,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-24 13:49:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-24 13:49:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-12-24 13:49:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-24 13:49:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-12-24 13:49:06,346 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-12-24 13:49:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:06,347 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-12-24 13:49:06,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-24 13:49:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-12-24 13:49:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-24 13:49:06,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:06,348 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-12-24 13:49:06,348 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-12-24 13:49:06,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:06,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:06,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:06,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:06,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:07,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:07,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:07,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:07,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:07,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:07,772 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:07,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:07,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:07,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:07,838 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:07,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:07,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:07,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:09,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:11,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:11,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2018-12-24 13:49:11,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:11,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-24 13:49:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-24 13:49:11,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 13:49:11,538 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-12-24 13:49:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:11,829 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-12-24 13:49:11,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-24 13:49:11,829 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-12-24 13:49:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:11,830 INFO L225 Difference]: With dead ends: 183 [2018-12-24 13:49:11,830 INFO L226 Difference]: Without dead ends: 182 [2018-12-24 13:49:11,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 13:49:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-24 13:49:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-12-24 13:49:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-24 13:49:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-12-24 13:49:11,836 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-12-24 13:49:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:11,836 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-12-24 13:49:11,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-24 13:49:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-12-24 13:49:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-24 13:49:11,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:11,837 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-12-24 13:49:11,837 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-12-24 13:49:11,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:11,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:11,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:11,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:11,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:13,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:13,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:13,148 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:13,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:13,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:13,148 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:13,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:13,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:13,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-24 13:49:13,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:13,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:13,313 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:13,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:13,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:13,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:14,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:17,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:17,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2018-12-24 13:49:17,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:17,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-24 13:49:17,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-24 13:49:17,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-24 13:49:17,189 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-12-24 13:49:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:17,643 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-12-24 13:49:17,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-24 13:49:17,643 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-12-24 13:49:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:17,645 INFO L225 Difference]: With dead ends: 187 [2018-12-24 13:49:17,645 INFO L226 Difference]: Without dead ends: 186 [2018-12-24 13:49:17,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-24 13:49:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-24 13:49:17,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-12-24 13:49:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-24 13:49:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-12-24 13:49:17,651 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-12-24 13:49:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:17,652 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-12-24 13:49:17,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-24 13:49:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-12-24 13:49:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-24 13:49:17,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:17,653 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-12-24 13:49:17,653 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:17,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:17,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-12-24 13:49:17,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:17,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:17,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:17,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:17,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:19,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:19,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:19,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:19,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:19,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:19,016 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:19,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:19,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:19,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:19,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:19,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:19,087 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:19,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:19,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:19,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:20,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:23,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:23,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-24 13:49:23,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:23,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-24 13:49:23,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-24 13:49:23,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 13:49:23,352 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-12-24 13:49:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:23,668 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-12-24 13:49:23,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-24 13:49:23,669 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-12-24 13:49:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:23,670 INFO L225 Difference]: With dead ends: 191 [2018-12-24 13:49:23,670 INFO L226 Difference]: Without dead ends: 190 [2018-12-24 13:49:23,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 13:49:23,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-24 13:49:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-12-24 13:49:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-24 13:49:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-12-24 13:49:23,677 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-12-24 13:49:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:23,677 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-12-24 13:49:23,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-24 13:49:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-12-24 13:49:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-24 13:49:23,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:23,678 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-12-24 13:49:23,678 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:23,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:23,678 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-12-24 13:49:23,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:23,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:23,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:23,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:23,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:25,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:25,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:25,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:25,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:25,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:25,452 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:25,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:25,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:25,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:25,523 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:25,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:25,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:25,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:27,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:30,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:30,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2018-12-24 13:49:30,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:30,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-24 13:49:30,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-24 13:49:30,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-24 13:49:30,917 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-12-24 13:49:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:31,278 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-12-24 13:49:31,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-24 13:49:31,279 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-12-24 13:49:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:31,280 INFO L225 Difference]: With dead ends: 195 [2018-12-24 13:49:31,280 INFO L226 Difference]: Without dead ends: 194 [2018-12-24 13:49:31,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-24 13:49:31,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-24 13:49:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-12-24 13:49:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-24 13:49:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-12-24 13:49:31,288 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-12-24 13:49:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:31,288 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-12-24 13:49:31,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-24 13:49:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-12-24 13:49:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-24 13:49:31,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:31,289 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-12-24 13:49:31,290 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:31,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-12-24 13:49:31,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:31,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:31,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:31,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:31,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:33,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:33,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:33,862 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:33,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:33,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:33,863 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:33,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:33,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:34,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-24 13:49:34,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:34,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:34,084 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:34,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:34,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:34,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:35,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:38,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:38,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2018-12-24 13:49:38,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:38,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-24 13:49:38,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-24 13:49:38,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 13:49:38,781 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-12-24 13:49:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:39,197 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-12-24 13:49:39,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-24 13:49:39,198 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-12-24 13:49:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:39,199 INFO L225 Difference]: With dead ends: 199 [2018-12-24 13:49:39,199 INFO L226 Difference]: Without dead ends: 198 [2018-12-24 13:49:39,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 13:49:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-24 13:49:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-12-24 13:49:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-24 13:49:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-12-24 13:49:39,205 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-12-24 13:49:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:39,205 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-12-24 13:49:39,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-24 13:49:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-12-24 13:49:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-24 13:49:39,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:39,206 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-12-24 13:49:39,206 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:39,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-12-24 13:49:39,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:39,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:39,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:39,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:39,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:40,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:40,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:40,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:40,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:40,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:40,559 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:40,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:40,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:40,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:40,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:40,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:40,631 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:40,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:40,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:40,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:42,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:45,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:45,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2018-12-24 13:49:45,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:45,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-24 13:49:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-24 13:49:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-24 13:49:45,402 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-12-24 13:49:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:45,762 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-12-24 13:49:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-24 13:49:45,762 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-12-24 13:49:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:45,763 INFO L225 Difference]: With dead ends: 203 [2018-12-24 13:49:45,764 INFO L226 Difference]: Without dead ends: 202 [2018-12-24 13:49:45,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-24 13:49:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-24 13:49:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-12-24 13:49:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-24 13:49:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-12-24 13:49:45,769 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-12-24 13:49:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:45,769 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-12-24 13:49:45,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-24 13:49:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-12-24 13:49:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-24 13:49:45,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:45,770 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-12-24 13:49:45,771 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-12-24 13:49:45,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:45,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:45,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:45,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:45,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:47,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:47,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:47,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:47,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:47,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:47,098 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:47,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:47,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:47,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:47,185 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:47,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:47,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:47,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:48,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:52,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:52,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2018-12-24 13:49:52,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:52,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-24 13:49:52,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-24 13:49:52,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 13:49:52,209 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-12-24 13:49:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:52,510 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-12-24 13:49:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-24 13:49:52,510 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-12-24 13:49:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:52,512 INFO L225 Difference]: With dead ends: 207 [2018-12-24 13:49:52,512 INFO L226 Difference]: Without dead ends: 206 [2018-12-24 13:49:52,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 13:49:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-24 13:49:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-12-24 13:49:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-24 13:49:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-12-24 13:49:52,518 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-12-24 13:49:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:52,519 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-12-24 13:49:52,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-24 13:49:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-12-24 13:49:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-24 13:49:52,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:52,520 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-12-24 13:49:52,520 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:52,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:52,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-12-24 13:49:52,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:52,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:52,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:52,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:54,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:54,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:54,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:54,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:54,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:54,380 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:54,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:54,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:54,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-24 13:49:54,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:54,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:54,595 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:54,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:54,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:54,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:56,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:59,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:59,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2018-12-24 13:49:59,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:59,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-24 13:49:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-24 13:49:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2018-12-24 13:49:59,705 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-12-24 13:50:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:00,129 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-12-24 13:50:00,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-24 13:50:00,129 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-12-24 13:50:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:00,131 INFO L225 Difference]: With dead ends: 211 [2018-12-24 13:50:00,131 INFO L226 Difference]: Without dead ends: 210 [2018-12-24 13:50:00,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2018-12-24 13:50:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-24 13:50:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-12-24 13:50:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-24 13:50:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-12-24 13:50:00,137 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-12-24 13:50:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:00,137 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-12-24 13:50:00,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-24 13:50:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-12-24 13:50:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-24 13:50:00,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:00,139 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-12-24 13:50:00,139 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-12-24 13:50:00,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:00,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:00,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:01,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:01,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:01,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:01,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:01,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:01,584 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:50:01,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:01,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:01,668 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:01,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:01,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:01,691 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:01,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:01,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:01,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:03,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:07,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:07,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2018-12-24 13:50:07,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:07,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-24 13:50:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-24 13:50:07,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 13:50:07,159 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-12-24 13:50:07,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:07,582 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-12-24 13:50:07,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-24 13:50:07,583 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-12-24 13:50:07,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:07,585 INFO L225 Difference]: With dead ends: 215 [2018-12-24 13:50:07,585 INFO L226 Difference]: Without dead ends: 214 [2018-12-24 13:50:07,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 13:50:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-24 13:50:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-12-24 13:50:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-24 13:50:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-12-24 13:50:07,592 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-12-24 13:50:07,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:07,592 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-12-24 13:50:07,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-24 13:50:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-12-24 13:50:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-24 13:50:07,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:07,593 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-12-24 13:50:07,594 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:07,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:07,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-12-24 13:50:07,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:07,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:07,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:09,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:09,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:09,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:09,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:09,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:09,255 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:50:09,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:09,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:09,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:09,346 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:09,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:09,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:09,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:11,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:14,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:14,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2018-12-24 13:50:14,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:14,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-24 13:50:14,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-24 13:50:14,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2018-12-24 13:50:14,663 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-12-24 13:50:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:15,028 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-12-24 13:50:15,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-24 13:50:15,029 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-12-24 13:50:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:15,030 INFO L225 Difference]: With dead ends: 219 [2018-12-24 13:50:15,030 INFO L226 Difference]: Without dead ends: 218 [2018-12-24 13:50:15,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2018-12-24 13:50:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-24 13:50:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-12-24 13:50:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-24 13:50:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-12-24 13:50:15,036 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-12-24 13:50:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:15,037 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-12-24 13:50:15,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-24 13:50:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-12-24 13:50:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-24 13:50:15,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:15,038 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-12-24 13:50:15,038 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:15,038 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-12-24 13:50:15,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:15,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:15,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:15,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:15,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:16,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:16,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:16,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:16,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:16,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:16,506 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:50:16,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:16,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:16,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-24 13:50:16,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:16,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:16,735 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:16,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:16,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:16,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:18,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:22,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:22,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2018-12-24 13:50:22,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:22,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-24 13:50:22,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-24 13:50:22,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 13:50:22,111 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-12-24 13:50:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:22,490 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-12-24 13:50:22,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-24 13:50:22,491 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-12-24 13:50:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:22,492 INFO L225 Difference]: With dead ends: 223 [2018-12-24 13:50:22,492 INFO L226 Difference]: Without dead ends: 222 [2018-12-24 13:50:22,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 322 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 13:50:22,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-24 13:50:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-12-24 13:50:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-24 13:50:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-12-24 13:50:22,498 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-12-24 13:50:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:22,498 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-12-24 13:50:22,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-24 13:50:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-12-24 13:50:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-24 13:50:22,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:22,499 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-12-24 13:50:22,499 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:22,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:22,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-12-24 13:50:22,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:22,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:22,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:24,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:24,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:24,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:24,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:24,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:24,318 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:50:24,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:24,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:24,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:24,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:24,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:24,432 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:24,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:24,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:24,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:26,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:30,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:30,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2018-12-24 13:50:30,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:30,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-24 13:50:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-24 13:50:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2018-12-24 13:50:30,025 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-12-24 13:50:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:30,458 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-12-24 13:50:30,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-24 13:50:30,459 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-12-24 13:50:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:30,460 INFO L225 Difference]: With dead ends: 227 [2018-12-24 13:50:30,461 INFO L226 Difference]: Without dead ends: 226 [2018-12-24 13:50:30,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2018-12-24 13:50:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-24 13:50:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-12-24 13:50:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-24 13:50:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-12-24 13:50:30,467 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-12-24 13:50:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:30,468 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-12-24 13:50:30,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-24 13:50:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-12-24 13:50:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-24 13:50:30,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:30,469 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-12-24 13:50:30,470 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:30,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-12-24 13:50:30,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:30,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:30,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:30,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:30,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:32,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:32,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:32,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:32,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:32,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:32,034 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:50:32,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:32,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:32,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:32,129 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:32,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:32,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:32,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:34,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:37,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:37,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2018-12-24 13:50:37,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:37,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-24 13:50:37,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-24 13:50:37,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 13:50:37,659 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-12-24 13:50:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:38,146 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-12-24 13:50:38,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-24 13:50:38,146 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-12-24 13:50:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:38,148 INFO L225 Difference]: With dead ends: 231 [2018-12-24 13:50:38,148 INFO L226 Difference]: Without dead ends: 230 [2018-12-24 13:50:38,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 13:50:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-24 13:50:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-12-24 13:50:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-24 13:50:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-12-24 13:50:38,155 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-12-24 13:50:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:38,155 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-12-24 13:50:38,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-24 13:50:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-12-24 13:50:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-24 13:50:38,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:38,156 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-12-24 13:50:38,157 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:38,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-12-24 13:50:38,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:38,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:38,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:38,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:38,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:40,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:40,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:40,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:40,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:40,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:40,087 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:50:40,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:40,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:40,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-24 13:50:40,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:40,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:40,336 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:40,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:40,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:40,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:42,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:42,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:46,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:46,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2018-12-24 13:50:46,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:46,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-24 13:50:46,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-24 13:50:46,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2018-12-24 13:50:46,014 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-12-24 13:50:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:46,486 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-12-24 13:50:46,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-24 13:50:46,487 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-12-24 13:50:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:46,488 INFO L225 Difference]: With dead ends: 235 [2018-12-24 13:50:46,488 INFO L226 Difference]: Without dead ends: 234 [2018-12-24 13:50:46,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2018-12-24 13:50:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-24 13:50:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-12-24 13:50:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-24 13:50:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-12-24 13:50:46,494 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-12-24 13:50:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:46,494 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-12-24 13:50:46,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-24 13:50:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-12-24 13:50:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-24 13:50:46,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:46,495 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-12-24 13:50:46,496 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:46,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:46,496 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-12-24 13:50:46,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:46,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:46,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:46,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:46,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:48,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:48,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:48,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:48,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:48,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:48,206 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:50:48,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:48,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:48,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:48,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:48,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:48,302 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:48,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:48,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:48,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:50,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:54,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:54,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2018-12-24 13:50:54,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:54,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-24 13:50:54,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-24 13:50:54,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 13:50:54,389 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-12-24 13:50:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:54,930 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-12-24 13:50:54,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-24 13:50:54,931 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-12-24 13:50:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:54,932 INFO L225 Difference]: With dead ends: 239 [2018-12-24 13:50:54,932 INFO L226 Difference]: Without dead ends: 238 [2018-12-24 13:50:54,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 13:50:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-24 13:50:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-12-24 13:50:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-24 13:50:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-12-24 13:50:54,938 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-12-24 13:50:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:54,938 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-12-24 13:50:54,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-24 13:50:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-12-24 13:50:54,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-24 13:50:54,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:54,939 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-12-24 13:50:54,939 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:54,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:54,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-12-24 13:50:54,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:54,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:54,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:54,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:54,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:56,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:56,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:56,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:56,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:56,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:56,686 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:50:56,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:56,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:56,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:56,766 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:56,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:56,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:56,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:58,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:02,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:02,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2018-12-24 13:51:02,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:02,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-24 13:51:02,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-24 13:51:02,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2018-12-24 13:51:02,715 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-12-24 13:51:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:03,180 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-12-24 13:51:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-24 13:51:03,180 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-12-24 13:51:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:03,182 INFO L225 Difference]: With dead ends: 243 [2018-12-24 13:51:03,182 INFO L226 Difference]: Without dead ends: 242 [2018-12-24 13:51:03,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2018-12-24 13:51:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-24 13:51:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-12-24 13:51:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-24 13:51:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-12-24 13:51:03,187 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-12-24 13:51:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:03,188 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-12-24 13:51:03,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-24 13:51:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-12-24 13:51:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-24 13:51:03,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:03,189 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-12-24 13:51:03,189 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:03,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:03,189 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-12-24 13:51:03,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:03,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:03,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:03,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:03,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:05,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:05,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:05,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:05,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:05,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:05,333 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:05,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:51:05,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:51:05,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-24 13:51:05,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:05,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:05,614 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:05,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:05,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:05,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:07,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:11,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:11,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2018-12-24 13:51:11,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:11,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-24 13:51:11,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-24 13:51:11,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 13:51:11,613 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-12-24 13:51:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:12,056 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-12-24 13:51:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-24 13:51:12,057 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-12-24 13:51:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:12,058 INFO L225 Difference]: With dead ends: 247 [2018-12-24 13:51:12,058 INFO L226 Difference]: Without dead ends: 246 [2018-12-24 13:51:12,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 13:51:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-24 13:51:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-12-24 13:51:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-24 13:51:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-12-24 13:51:12,064 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-12-24 13:51:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:12,064 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-12-24 13:51:12,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-24 13:51:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-12-24 13:51:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-24 13:51:12,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:12,066 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-12-24 13:51:12,066 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-12-24 13:51:12,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:12,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:12,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:12,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:12,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:13,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:13,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:13,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:13,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:13,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:13,856 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:13,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:51:13,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:51:13,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:51:13,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:13,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:13,947 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:13,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:16,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:20,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:20,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2018-12-24 13:51:20,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:20,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-24 13:51:20,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-24 13:51:20,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2018-12-24 13:51:20,205 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-12-24 13:51:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:20,744 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-12-24 13:51:20,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-24 13:51:20,744 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-12-24 13:51:20,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:20,745 INFO L225 Difference]: With dead ends: 251 [2018-12-24 13:51:20,745 INFO L226 Difference]: Without dead ends: 250 [2018-12-24 13:51:20,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2018-12-24 13:51:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-24 13:51:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-12-24 13:51:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-24 13:51:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-12-24 13:51:20,752 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-12-24 13:51:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:20,752 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-12-24 13:51:20,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-24 13:51:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-12-24 13:51:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-24 13:51:20,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:20,754 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-12-24 13:51:20,754 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:20,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:20,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-12-24 13:51:20,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:20,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:20,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:22,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:22,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:22,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:22,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:22,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:22,731 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:22,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:22,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:22,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:22,815 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:22,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:22,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:22,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:25,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:28,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:28,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2018-12-24 13:51:28,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:28,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-24 13:51:28,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-24 13:51:28,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 13:51:28,993 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-12-24 13:51:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:29,419 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-12-24 13:51:29,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-24 13:51:29,419 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-12-24 13:51:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:29,421 INFO L225 Difference]: With dead ends: 255 [2018-12-24 13:51:29,421 INFO L226 Difference]: Without dead ends: 254 [2018-12-24 13:51:29,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 13:51:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-24 13:51:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-12-24 13:51:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-24 13:51:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-12-24 13:51:29,427 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-12-24 13:51:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:29,427 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-12-24 13:51:29,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-24 13:51:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-12-24 13:51:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-24 13:51:29,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:29,428 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-12-24 13:51:29,429 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-12-24 13:51:29,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:29,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:29,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:29,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:29,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:31,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:31,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:31,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:31,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:31,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:31,572 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:31,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:51:31,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:51:31,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-24 13:51:31,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:31,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:31,873 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:31,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:31,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:31,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:34,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:38,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:38,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2018-12-24 13:51:38,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:38,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-24 13:51:38,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-24 13:51:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2018-12-24 13:51:38,177 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-12-24 13:51:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:38,616 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-12-24 13:51:38,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-24 13:51:38,617 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-12-24 13:51:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:38,618 INFO L225 Difference]: With dead ends: 259 [2018-12-24 13:51:38,618 INFO L226 Difference]: Without dead ends: 258 [2018-12-24 13:51:38,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2018-12-24 13:51:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-24 13:51:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-12-24 13:51:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-24 13:51:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-12-24 13:51:38,623 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-12-24 13:51:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:38,623 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-12-24 13:51:38,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-24 13:51:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-12-24 13:51:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-24 13:51:38,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:38,624 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-12-24 13:51:38,625 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:38,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:38,625 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-12-24 13:51:38,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:38,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:38,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:38,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:38,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:40,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:40,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:40,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:40,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:40,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:40,697 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:40,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:51:40,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:51:40,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:51:40,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:40,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:40,798 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:40,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:43,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:47,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:47,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2018-12-24 13:51:47,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:47,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-24 13:51:47,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-24 13:51:47,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 13:51:47,366 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-12-24 13:51:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:47,825 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-12-24 13:51:47,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-24 13:51:47,825 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-12-24 13:51:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:47,827 INFO L225 Difference]: With dead ends: 263 [2018-12-24 13:51:47,827 INFO L226 Difference]: Without dead ends: 262 [2018-12-24 13:51:47,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 13:51:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-24 13:51:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-12-24 13:51:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-12-24 13:51:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-12-24 13:51:47,834 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-12-24 13:51:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:47,835 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-12-24 13:51:47,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-24 13:51:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-12-24 13:51:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-12-24 13:51:47,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:47,836 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-12-24 13:51:47,836 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-12-24 13:51:47,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:47,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:47,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:47,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:47,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:49,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:49,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:49,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:49,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:49,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:49,872 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:49,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:49,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:49,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:49,964 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:49,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:49,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:49,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:52,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:56,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:56,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2018-12-24 13:51:56,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:56,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-24 13:51:56,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-24 13:51:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2018-12-24 13:51:56,573 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-12-24 13:51:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:57,046 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-12-24 13:51:57,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-24 13:51:57,046 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-12-24 13:51:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:57,047 INFO L225 Difference]: With dead ends: 267 [2018-12-24 13:51:57,047 INFO L226 Difference]: Without dead ends: 266 [2018-12-24 13:51:57,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2018-12-24 13:51:57,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-24 13:51:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-12-24 13:51:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-24 13:51:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-12-24 13:51:57,055 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-12-24 13:51:57,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:57,055 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-12-24 13:51:57,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-24 13:51:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-12-24 13:51:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-12-24 13:51:57,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:57,057 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-12-24 13:51:57,057 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:57,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:57,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-12-24 13:51:57,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:57,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:57,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:57,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:57,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:59,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:59,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:59,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:59,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:59,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:59,206 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:59,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:51:59,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:51:59,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-24 13:51:59,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:59,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:59,537 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:59,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:59,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:59,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:52:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:02,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:06,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:06,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2018-12-24 13:52:06,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:06,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-24 13:52:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-24 13:52:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 13:52:06,181 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-12-24 13:52:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:06,828 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-12-24 13:52:06,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-24 13:52:06,829 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-12-24 13:52:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:06,830 INFO L225 Difference]: With dead ends: 271 [2018-12-24 13:52:06,831 INFO L226 Difference]: Without dead ends: 270 [2018-12-24 13:52:06,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 13:52:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-24 13:52:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-12-24 13:52:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-24 13:52:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-12-24 13:52:06,838 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-12-24 13:52:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:06,838 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-12-24 13:52:06,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-24 13:52:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-12-24 13:52:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-24 13:52:06,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:06,840 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-12-24 13:52:06,840 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-12-24 13:52:06,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:06,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:06,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:06,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:06,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:09,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:09,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:09,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:09,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:09,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:09,066 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:52:09,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:52:09,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:52:09,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:52:09,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:09,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:09,166 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:52:09,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:09,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:09,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:52:12,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:12,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:15,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:15,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2018-12-24 13:52:15,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:15,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-24 13:52:15,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-24 13:52:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2018-12-24 13:52:15,854 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-12-24 13:52:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:16,360 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-12-24 13:52:16,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-24 13:52:16,360 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-12-24 13:52:16,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:16,361 INFO L225 Difference]: With dead ends: 275 [2018-12-24 13:52:16,361 INFO L226 Difference]: Without dead ends: 274 [2018-12-24 13:52:16,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2018-12-24 13:52:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-24 13:52:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-12-24 13:52:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-24 13:52:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-12-24 13:52:16,366 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-12-24 13:52:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:16,367 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-12-24 13:52:16,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-24 13:52:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-12-24 13:52:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-24 13:52:16,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:16,368 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-12-24 13:52:16,368 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:16,368 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-12-24 13:52:16,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:16,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:16,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:16,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:16,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:18,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:18,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:18,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:18,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:18,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:18,730 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:52:18,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:18,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:18,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:18,820 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:52:18,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:18,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:18,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:52:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:21,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:25,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:25,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2018-12-24 13:52:25,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:25,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-24 13:52:25,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-24 13:52:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 13:52:25,738 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-12-24 13:52:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:26,326 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-12-24 13:52:26,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-24 13:52:26,326 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-12-24 13:52:26,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:26,328 INFO L225 Difference]: With dead ends: 279 [2018-12-24 13:52:26,328 INFO L226 Difference]: Without dead ends: 278 [2018-12-24 13:52:26,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 406 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 13:52:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-24 13:52:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-12-24 13:52:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-24 13:52:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-12-24 13:52:26,334 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-12-24 13:52:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:26,335 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-12-24 13:52:26,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-24 13:52:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-12-24 13:52:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-24 13:52:26,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:26,336 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-12-24 13:52:26,337 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:26,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-12-24 13:52:26,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:26,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:26,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:26,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:26,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:28,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:28,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:28,876 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:28,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:28,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:28,876 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:52:28,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:28,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:29,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-24 13:52:29,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:29,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:29,284 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:52:29,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:29,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:29,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:52:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:32,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:36,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:36,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2018-12-24 13:52:36,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:36,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-24 13:52:36,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-24 13:52:36,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2018-12-24 13:52:36,174 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-12-24 13:52:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:36,668 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-12-24 13:52:36,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-24 13:52:36,668 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-12-24 13:52:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:36,670 INFO L225 Difference]: With dead ends: 283 [2018-12-24 13:52:36,670 INFO L226 Difference]: Without dead ends: 282 [2018-12-24 13:52:36,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 412 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2018-12-24 13:52:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-24 13:52:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-12-24 13:52:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-24 13:52:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-12-24 13:52:36,678 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-12-24 13:52:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:36,678 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-12-24 13:52:36,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-24 13:52:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-12-24 13:52:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-24 13:52:36,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:36,680 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-12-24 13:52:36,680 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:36,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:36,680 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-12-24 13:52:36,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:36,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:36,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:36,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:36,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:39,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:39,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:39,368 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:39,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:39,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:39,368 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:52:39,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:52:39,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:52:39,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:52:39,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:39,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:39,473 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:52:39,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:52:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:42,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:46,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:46,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2018-12-24 13:52:46,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:46,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-24 13:52:46,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-24 13:52:46,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 13:52:46,505 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-12-24 13:52:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:47,045 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-12-24 13:52:47,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-24 13:52:47,045 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-12-24 13:52:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:47,047 INFO L225 Difference]: With dead ends: 287 [2018-12-24 13:52:47,047 INFO L226 Difference]: Without dead ends: 286 [2018-12-24 13:52:47,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 13:52:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-24 13:52:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-12-24 13:52:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-12-24 13:52:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-12-24 13:52:47,053 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-12-24 13:52:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:47,053 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-12-24 13:52:47,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-24 13:52:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-12-24 13:52:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-24 13:52:47,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:47,054 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-12-24 13:52:47,055 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:47,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:47,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-12-24 13:52:47,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:47,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:47,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:47,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:49,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:49,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:49,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:49,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:49,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:49,738 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:52:49,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:49,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:49,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:49,831 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:52:49,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:49,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:49,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:52:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:52,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:56,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:56,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2018-12-24 13:52:56,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:56,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-24 13:52:56,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-24 13:52:56,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2018-12-24 13:52:56,932 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-12-24 13:52:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:57,519 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-12-24 13:52:57,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-24 13:52:57,519 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-12-24 13:52:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:57,521 INFO L225 Difference]: With dead ends: 291 [2018-12-24 13:52:57,521 INFO L226 Difference]: Without dead ends: 290 [2018-12-24 13:52:57,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2018-12-24 13:52:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-24 13:52:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-12-24 13:52:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-24 13:52:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-12-24 13:52:57,527 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-12-24 13:52:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:57,527 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-12-24 13:52:57,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-24 13:52:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-12-24 13:52:57,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-12-24 13:52:57,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:57,528 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-12-24 13:52:57,528 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-12-24 13:52:57,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:57,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:57,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:00,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:00,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:00,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:00,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:00,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:00,086 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:53:00,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:00,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:00,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-24 13:53:00,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:00,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:00,470 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:53:00,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:00,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:00,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:53:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:03,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:08,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:08,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2018-12-24 13:53:08,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:08,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-24 13:53:08,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-24 13:53:08,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 13:53:08,183 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-12-24 13:53:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:08,736 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-12-24 13:53:08,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-24 13:53:08,736 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-12-24 13:53:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:08,738 INFO L225 Difference]: With dead ends: 295 [2018-12-24 13:53:08,738 INFO L226 Difference]: Without dead ends: 294 [2018-12-24 13:53:08,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 13:53:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-24 13:53:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-12-24 13:53:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-12-24 13:53:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-12-24 13:53:08,744 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-12-24 13:53:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:08,744 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-12-24 13:53:08,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-24 13:53:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-12-24 13:53:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-24 13:53:08,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:08,746 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-12-24 13:53:08,746 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:08,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:08,746 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-12-24 13:53:08,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:08,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:08,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:08,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:08,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:11,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:11,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:11,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:11,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:11,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:11,322 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:53:11,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:53:11,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:53:11,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:53:11,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:11,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:11,456 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:53:11,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:11,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:11,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:53:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:14,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:18,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:18,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2018-12-24 13:53:18,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:18,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-24 13:53:18,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-24 13:53:18,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2018-12-24 13:53:18,912 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-12-24 13:53:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:19,553 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-12-24 13:53:19,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-24 13:53:19,553 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-12-24 13:53:19,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:19,555 INFO L225 Difference]: With dead ends: 299 [2018-12-24 13:53:19,556 INFO L226 Difference]: Without dead ends: 298 [2018-12-24 13:53:19,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2018-12-24 13:53:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-24 13:53:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-12-24 13:53:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-24 13:53:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-12-24 13:53:19,561 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-12-24 13:53:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:19,562 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-12-24 13:53:19,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-24 13:53:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-12-24 13:53:19,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-12-24 13:53:19,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:19,563 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-12-24 13:53:19,563 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:19,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:19,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-12-24 13:53:19,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:19,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:19,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:19,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:19,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:22,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:22,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:22,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:22,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:22,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:22,243 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:53:22,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:22,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:22,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:22,342 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:53:22,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:22,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:22,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:53:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:25,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:30,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:30,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2018-12-24 13:53:30,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:30,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-24 13:53:30,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-24 13:53:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 13:53:30,095 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-12-24 13:53:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:30,617 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-12-24 13:53:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-24 13:53:30,618 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-12-24 13:53:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:30,620 INFO L225 Difference]: With dead ends: 303 [2018-12-24 13:53:30,620 INFO L226 Difference]: Without dead ends: 302 [2018-12-24 13:53:30,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 13:53:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-24 13:53:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-12-24 13:53:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-24 13:53:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-12-24 13:53:30,626 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-12-24 13:53:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:30,626 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-12-24 13:53:30,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-24 13:53:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-12-24 13:53:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-24 13:53:30,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:30,627 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-12-24 13:53:30,628 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:30,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:30,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-12-24 13:53:30,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:30,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:30,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:30,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:30,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:33,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:33,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:33,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:33,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:33,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:33,297 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:53:33,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:33,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:33,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-24 13:53:33,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:33,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:33,727 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:53:33,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:33,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:33,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:53:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:36,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:41,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:41,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2018-12-24 13:53:41,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:41,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-12-24 13:53:41,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-12-24 13:53:41,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2018-12-24 13:53:41,271 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-12-24 13:53:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:41,920 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-12-24 13:53:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-24 13:53:41,920 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-12-24 13:53:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:41,922 INFO L225 Difference]: With dead ends: 307 [2018-12-24 13:53:41,922 INFO L226 Difference]: Without dead ends: 306 [2018-12-24 13:53:41,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2018-12-24 13:53:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-24 13:53:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-12-24 13:53:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-24 13:53:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-12-24 13:53:41,928 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-12-24 13:53:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:41,928 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-12-24 13:53:41,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-12-24 13:53:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-12-24 13:53:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-12-24 13:53:41,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:41,929 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-12-24 13:53:41,929 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:41,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:41,930 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-12-24 13:53:41,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:41,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:41,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:45,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:45,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:45,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:45,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:45,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:45,011 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:53:45,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:53:45,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:53:45,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:53:45,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:45,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:45,131 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:53:45,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:53:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:48,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:52,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:52,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2018-12-24 13:53:52,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:52,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-24 13:53:52,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-24 13:53:52,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 13:53:52,683 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-12-24 13:53:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:53,269 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-12-24 13:53:53,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-24 13:53:53,270 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-12-24 13:53:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:53,271 INFO L225 Difference]: With dead ends: 311 [2018-12-24 13:53:53,271 INFO L226 Difference]: Without dead ends: 310 [2018-12-24 13:53:53,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 13:53:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-24 13:53:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-12-24 13:53:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-12-24 13:53:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-12-24 13:53:53,277 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-12-24 13:53:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:53,277 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-12-24 13:53:53,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-24 13:53:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-12-24 13:53:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-12-24 13:53:53,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:53,278 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-12-24 13:53:53,279 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:53,279 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2018-12-24 13:53:53,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:53,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:53,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:53,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:53,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:56,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:56,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:56,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:56,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:56,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:56,364 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:53:56,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:56,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:56,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:56,468 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:53:56,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:54:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:00,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:04,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:04,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2018-12-24 13:54:04,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:04,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-24 13:54:04,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-24 13:54:04,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2018-12-24 13:54:04,602 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2018-12-24 13:54:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:05,202 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-12-24 13:54:05,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-24 13:54:05,202 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2018-12-24 13:54:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:05,204 INFO L225 Difference]: With dead ends: 315 [2018-12-24 13:54:05,204 INFO L226 Difference]: Without dead ends: 314 [2018-12-24 13:54:05,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2018-12-24 13:54:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-24 13:54:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2018-12-24 13:54:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-12-24 13:54:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-12-24 13:54:05,210 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2018-12-24 13:54:05,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:05,210 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-12-24 13:54:05,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-24 13:54:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-12-24 13:54:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-12-24 13:54:05,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:05,211 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2018-12-24 13:54:05,211 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:05,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2018-12-24 13:54:05,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:05,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:05,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:05,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:05,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:08,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:08,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:08,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:08,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:08,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:08,130 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:54:08,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:54:08,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:54:08,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-24 13:54:08,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:08,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:08,588 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:54:08,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:54:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:12,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:16,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:16,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2018-12-24 13:54:16,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:16,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-24 13:54:16,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-24 13:54:16,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 13:54:16,690 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2018-12-24 13:54:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:17,344 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-12-24 13:54:17,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-24 13:54:17,344 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2018-12-24 13:54:17,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:17,346 INFO L225 Difference]: With dead ends: 319 [2018-12-24 13:54:17,346 INFO L226 Difference]: Without dead ends: 318 [2018-12-24 13:54:17,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 13:54:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-24 13:54:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2018-12-24 13:54:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-12-24 13:54:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-12-24 13:54:17,352 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2018-12-24 13:54:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:17,353 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-12-24 13:54:17,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-24 13:54:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-12-24 13:54:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-12-24 13:54:17,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:17,354 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2018-12-24 13:54:17,354 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:17,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:17,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2018-12-24 13:54:17,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:17,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:17,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:17,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:17,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:20,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:20,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:20,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:20,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:20,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:20,700 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:54:20,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:54:20,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:54:20,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:54:20,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:20,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:20,825 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:54:20,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:54:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:24,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:28,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:28,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2018-12-24 13:54:28,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:28,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-24 13:54:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-24 13:54:28,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2018-12-24 13:54:28,927 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2018-12-24 13:54:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:29,595 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-12-24 13:54:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-24 13:54:29,596 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2018-12-24 13:54:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:29,597 INFO L225 Difference]: With dead ends: 323 [2018-12-24 13:54:29,597 INFO L226 Difference]: Without dead ends: 322 [2018-12-24 13:54:29,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2018-12-24 13:54:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-24 13:54:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2018-12-24 13:54:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-24 13:54:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-12-24 13:54:29,603 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2018-12-24 13:54:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:29,603 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-12-24 13:54:29,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-24 13:54:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-12-24 13:54:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-12-24 13:54:29,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:29,605 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2018-12-24 13:54:29,605 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2018-12-24 13:54:29,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:29,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:29,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:29,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:29,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:32,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:32,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:32,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:32,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:32,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:32,891 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:54:32,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:32,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:32,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:32,995 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:54:32,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:33,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:33,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:54:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:36,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:41,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:41,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2018-12-24 13:54:41,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:41,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-24 13:54:41,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-24 13:54:41,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 13:54:41,368 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2018-12-24 13:54:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:42,025 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-12-24 13:54:42,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-24 13:54:42,025 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2018-12-24 13:54:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:42,027 INFO L225 Difference]: With dead ends: 327 [2018-12-24 13:54:42,027 INFO L226 Difference]: Without dead ends: 326 [2018-12-24 13:54:42,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 13:54:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-24 13:54:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-12-24 13:54:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-24 13:54:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-12-24 13:54:42,032 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2018-12-24 13:54:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:42,033 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-12-24 13:54:42,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-24 13:54:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-12-24 13:54:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-12-24 13:54:42,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:42,034 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2018-12-24 13:54:42,034 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:42,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:42,035 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2018-12-24 13:54:42,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:42,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:42,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:42,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:42,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:45,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:45,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:45,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:45,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:45,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:45,657 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:54:45,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:54:45,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:54:46,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-24 13:54:46,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:46,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:46,149 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:54:46,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:46,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:46,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:54:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:49,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:54,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:54,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2018-12-24 13:54:54,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:54,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-12-24 13:54:54,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-12-24 13:54:54,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2018-12-24 13:54:54,386 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2018-12-24 13:54:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:55,049 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-12-24 13:54:55,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-24 13:54:55,050 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2018-12-24 13:54:55,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:55,051 INFO L225 Difference]: With dead ends: 331 [2018-12-24 13:54:55,051 INFO L226 Difference]: Without dead ends: 330 [2018-12-24 13:54:55,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2018-12-24 13:54:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-24 13:54:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2018-12-24 13:54:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-24 13:54:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-12-24 13:54:55,057 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2018-12-24 13:54:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:55,058 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-12-24 13:54:55,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-12-24 13:54:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-12-24 13:54:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-12-24 13:54:55,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:55,059 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2018-12-24 13:54:55,059 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:55,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:55,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2018-12-24 13:54:55,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:55,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:55,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:55,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:55,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:58,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:58,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:58,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:58,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:58,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:58,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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:54:58,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:54:58,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:54:58,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:54:58,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:58,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:58,524 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:54:58,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:58,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:58,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:55:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:02,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:07,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:07,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2018-12-24 13:55:07,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:07,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-24 13:55:07,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-24 13:55:07,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 13:55:07,084 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2018-12-24 13:55:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:07,756 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-12-24 13:55:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-24 13:55:07,756 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2018-12-24 13:55:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:07,757 INFO L225 Difference]: With dead ends: 335 [2018-12-24 13:55:07,758 INFO L226 Difference]: Without dead ends: 334 [2018-12-24 13:55:07,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 13:55:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-24 13:55:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2018-12-24 13:55:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-12-24 13:55:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-12-24 13:55:07,763 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2018-12-24 13:55:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:07,763 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-12-24 13:55:07,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-24 13:55:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-12-24 13:55:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-12-24 13:55:07,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:07,765 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2018-12-24 13:55:07,765 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:07,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:07,765 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2018-12-24 13:55:07,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:07,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:07,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:07,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:07,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:11,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:11,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:11,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:11,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:11,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:11,257 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:55:11,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:11,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:11,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:11,363 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:55:11,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:11,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:11,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:55:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:15,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:19,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:19,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2018-12-24 13:55:19,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:19,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-12-24 13:55:19,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-12-24 13:55:19,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2018-12-24 13:55:19,817 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2018-12-24 13:55:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:20,443 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-12-24 13:55:20,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-24 13:55:20,443 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2018-12-24 13:55:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:20,445 INFO L225 Difference]: With dead ends: 339 [2018-12-24 13:55:20,445 INFO L226 Difference]: Without dead ends: 338 [2018-12-24 13:55:20,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2018-12-24 13:55:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-12-24 13:55:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2018-12-24 13:55:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-12-24 13:55:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-12-24 13:55:20,450 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2018-12-24 13:55:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:20,450 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-12-24 13:55:20,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-12-24 13:55:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-12-24 13:55:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-12-24 13:55:20,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:20,452 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2018-12-24 13:55:20,452 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2018-12-24 13:55:20,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:20,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:20,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:20,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:20,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:24,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:24,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:24,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:24,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:24,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:24,022 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:55:24,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:55:24,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:55:24,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-24 13:55:24,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:24,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:24,575 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:55:24,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:24,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:24,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:55:28,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:28,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:33,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:33,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2018-12-24 13:55:33,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:33,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-24 13:55:33,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-24 13:55:33,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 13:55:33,363 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2018-12-24 13:55:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:34,130 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-12-24 13:55:34,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-24 13:55:34,130 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2018-12-24 13:55:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:34,132 INFO L225 Difference]: With dead ends: 343 [2018-12-24 13:55:34,132 INFO L226 Difference]: Without dead ends: 342 [2018-12-24 13:55:34,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 13:55:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-12-24 13:55:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2018-12-24 13:55:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-24 13:55:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-12-24 13:55:34,138 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2018-12-24 13:55:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:34,138 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-12-24 13:55:34,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-24 13:55:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-12-24 13:55:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-12-24 13:55:34,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:34,139 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2018-12-24 13:55:34,139 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2018-12-24 13:55:34,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:34,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:34,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:34,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:37,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:37,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:37,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:37,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:37,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:37,889 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:55:37,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:55:37,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:55:38,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:55:38,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:38,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:38,032 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:55:38,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:38,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:38,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:55:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:42,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:46,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:46,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2018-12-24 13:55:46,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:46,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-12-24 13:55:46,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-12-24 13:55:46,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2018-12-24 13:55:46,548 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2018-12-24 13:55:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:47,366 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-12-24 13:55:47,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-24 13:55:47,367 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2018-12-24 13:55:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:47,369 INFO L225 Difference]: With dead ends: 347 [2018-12-24 13:55:47,369 INFO L226 Difference]: Without dead ends: 346 [2018-12-24 13:55:47,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2018-12-24 13:55:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-12-24 13:55:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2018-12-24 13:55:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-12-24 13:55:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-12-24 13:55:47,376 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2018-12-24 13:55:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:47,376 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-12-24 13:55:47,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-12-24 13:55:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-12-24 13:55:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-12-24 13:55:47,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:47,378 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2018-12-24 13:55:47,378 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2018-12-24 13:55:47,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:47,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:47,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:47,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:47,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:50,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:50,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:50,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:50,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:50,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:50,905 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:55:50,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:50,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:51,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:51,021 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:55:51,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:51,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:51,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:55:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:55,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:00,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:00,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2018-12-24 13:56:00,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:00,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-24 13:56:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-24 13:56:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 13:56:00,227 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2018-12-24 13:56:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:00,977 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-12-24 13:56:00,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-24 13:56:00,978 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2018-12-24 13:56:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:00,980 INFO L225 Difference]: With dead ends: 351 [2018-12-24 13:56:00,980 INFO L226 Difference]: Without dead ends: 350 [2018-12-24 13:56:00,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 514 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 13:56:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-12-24 13:56:00,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2018-12-24 13:56:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-24 13:56:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-12-24 13:56:00,986 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2018-12-24 13:56:00,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:00,987 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-12-24 13:56:00,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-24 13:56:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-12-24 13:56:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-12-24 13:56:00,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:00,988 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2018-12-24 13:56:00,988 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2018-12-24 13:56:00,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:00,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:00,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:00,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:00,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:05,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:05,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:05,131 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:05,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:05,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:05,131 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:56:05,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:05,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:05,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-24 13:56:05,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:05,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:05,702 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:56:05,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:56:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:10,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:14,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:14,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2018-12-24 13:56:14,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:14,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-12-24 13:56:14,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-12-24 13:56:14,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2018-12-24 13:56:14,721 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2018-12-24 13:56:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:15,437 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-12-24 13:56:15,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-24 13:56:15,438 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2018-12-24 13:56:15,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:15,440 INFO L225 Difference]: With dead ends: 355 [2018-12-24 13:56:15,440 INFO L226 Difference]: Without dead ends: 354 [2018-12-24 13:56:15,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 520 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2018-12-24 13:56:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-24 13:56:15,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2018-12-24 13:56:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-24 13:56:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-12-24 13:56:15,446 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2018-12-24 13:56:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:15,446 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-12-24 13:56:15,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-12-24 13:56:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-12-24 13:56:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-12-24 13:56:15,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:15,448 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2018-12-24 13:56:15,448 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:15,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2018-12-24 13:56:15,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:15,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:15,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:15,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:15,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:19,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:19,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:19,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:19,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:19,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:19,337 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:56:19,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:56:19,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:56:19,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:56:19,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:19,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:19,477 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:56:19,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:19,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:19,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:56:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:24,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:28,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:28,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2018-12-24 13:56:28,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:28,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-12-24 13:56:28,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-12-24 13:56:28,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 13:56:28,688 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2018-12-24 13:56:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:29,376 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-12-24 13:56:29,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-24 13:56:29,376 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2018-12-24 13:56:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:29,378 INFO L225 Difference]: With dead ends: 359 [2018-12-24 13:56:29,378 INFO L226 Difference]: Without dead ends: 358 [2018-12-24 13:56:29,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 13:56:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-12-24 13:56:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2018-12-24 13:56:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-12-24 13:56:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-12-24 13:56:29,384 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2018-12-24 13:56:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:29,384 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-12-24 13:56:29,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-12-24 13:56:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-12-24 13:56:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-12-24 13:56:29,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:29,386 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2018-12-24 13:56:29,386 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2018-12-24 13:56:29,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:29,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:29,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:33,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:33,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:33,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:33,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:33,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:33,361 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:56:33,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:33,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:33,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:33,474 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:56:33,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:33,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:33,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:56:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:38,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:42,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:42,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2018-12-24 13:56:42,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:42,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-12-24 13:56:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-12-24 13:56:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2018-12-24 13:56:42,373 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2018-12-24 13:56:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:43,258 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-12-24 13:56:43,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-24 13:56:43,259 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2018-12-24 13:56:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:43,260 INFO L225 Difference]: With dead ends: 363 [2018-12-24 13:56:43,260 INFO L226 Difference]: Without dead ends: 362 [2018-12-24 13:56:43,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2018-12-24 13:56:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-12-24 13:56:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2018-12-24 13:56:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-24 13:56:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-12-24 13:56:43,266 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2018-12-24 13:56:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:43,266 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-12-24 13:56:43,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-12-24 13:56:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-12-24 13:56:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-12-24 13:56:43,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:43,268 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2018-12-24 13:56:43,268 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:43,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:43,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2018-12-24 13:56:43,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:43,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:43,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:43,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:43,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:47,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:47,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:47,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:47,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:47,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:47,176 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:56:47,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:47,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:47,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-24 13:56:47,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:47,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:47,802 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:56:47,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:47,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:47,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:56:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:52,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:57,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:57,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2018-12-24 13:56:57,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:57,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-24 13:56:57,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-24 13:56:57,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 13:56:57,321 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2018-12-24 13:56:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:58,062 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-12-24 13:56:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-24 13:56:58,062 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2018-12-24 13:56:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:58,064 INFO L225 Difference]: With dead ends: 367 [2018-12-24 13:56:58,064 INFO L226 Difference]: Without dead ends: 366 [2018-12-24 13:56:58,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 13:56:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-24 13:56:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2018-12-24 13:56:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-24 13:56:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2018-12-24 13:56:58,071 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2018-12-24 13:56:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:58,071 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2018-12-24 13:56:58,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-24 13:56:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2018-12-24 13:56:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-12-24 13:56:58,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:58,073 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2018-12-24 13:56:58,073 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:58,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2018-12-24 13:56:58,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:58,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:58,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:58,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:58,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:02,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:02,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:02,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:02,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:02,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:02,167 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:57:02,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:57:02,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:57:02,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:57:02,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:02,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:02,311 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:57:02,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:02,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:02,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:57:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:07,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:11,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:11,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2018-12-24 13:57:11,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:11,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-12-24 13:57:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-12-24 13:57:11,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2018-12-24 13:57:11,804 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2018-12-24 13:57:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:12,514 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-12-24 13:57:12,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-24 13:57:12,515 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2018-12-24 13:57:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:12,517 INFO L225 Difference]: With dead ends: 371 [2018-12-24 13:57:12,517 INFO L226 Difference]: Without dead ends: 370 [2018-12-24 13:57:12,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2018-12-24 13:57:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-12-24 13:57:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2018-12-24 13:57:12,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-24 13:57:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2018-12-24 13:57:12,522 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2018-12-24 13:57:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:12,523 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2018-12-24 13:57:12,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-12-24 13:57:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2018-12-24 13:57:12,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-12-24 13:57:12,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:12,524 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2018-12-24 13:57:12,524 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:12,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:12,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2018-12-24 13:57:12,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:12,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:12,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:12,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:12,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:16,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:16,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:16,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:16,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:16,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:16,742 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:57:16,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:16,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:16,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:16,867 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:57:16,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:16,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:16,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:57:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:21,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:26,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:26,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2018-12-24 13:57:26,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:26,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-24 13:57:26,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-24 13:57:26,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 13:57:26,709 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2018-12-24 13:57:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:27,429 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-12-24 13:57:27,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-24 13:57:27,429 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2018-12-24 13:57:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:27,431 INFO L225 Difference]: With dead ends: 375 [2018-12-24 13:57:27,432 INFO L226 Difference]: Without dead ends: 374 [2018-12-24 13:57:27,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 13:57:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-12-24 13:57:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-12-24 13:57:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-24 13:57:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-12-24 13:57:27,438 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2018-12-24 13:57:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:27,438 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-12-24 13:57:27,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-24 13:57:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-12-24 13:57:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-12-24 13:57:27,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:27,440 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2018-12-24 13:57:27,440 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:27,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:27,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2018-12-24 13:57:27,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:27,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:27,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:27,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:27,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:31,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:31,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:31,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:31,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:31,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:31,781 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:57:31,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:31,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:32,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-24 13:57:32,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:32,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:32,442 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:57:32,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:32,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:32,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:57:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:37,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:42,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:42,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2018-12-24 13:57:42,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:42,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-12-24 13:57:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-12-24 13:57:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2018-12-24 13:57:42,314 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2018-12-24 13:57:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:43,037 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-12-24 13:57:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-24 13:57:43,038 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2018-12-24 13:57:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:43,039 INFO L225 Difference]: With dead ends: 379 [2018-12-24 13:57:43,040 INFO L226 Difference]: Without dead ends: 378 [2018-12-24 13:57:43,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 556 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2018-12-24 13:57:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-24 13:57:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2018-12-24 13:57:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-12-24 13:57:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2018-12-24 13:57:43,045 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2018-12-24 13:57:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:43,046 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2018-12-24 13:57:43,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-12-24 13:57:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2018-12-24 13:57:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-12-24 13:57:43,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:43,047 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2018-12-24 13:57:43,048 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:43,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2018-12-24 13:57:43,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:43,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:43,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:43,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:43,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:47,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:47,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:47,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:47,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:47,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:47,491 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:57:47,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:57:47,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:57:47,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:57:47,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:47,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:47,636 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:57:47,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:47,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:47,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:57:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:52,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:57,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:57,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2018-12-24 13:57:57,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:57,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-12-24 13:57:57,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-12-24 13:57:57,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 13:57:57,469 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2018-12-24 13:57:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:58,155 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-12-24 13:57:58,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-24 13:57:58,156 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2018-12-24 13:57:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:58,158 INFO L225 Difference]: With dead ends: 383 [2018-12-24 13:57:58,158 INFO L226 Difference]: Without dead ends: 382 [2018-12-24 13:57:58,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 13:57:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-24 13:57:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-12-24 13:57:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-24 13:57:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-12-24 13:57:58,165 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2018-12-24 13:57:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:58,165 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-12-24 13:57:58,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-12-24 13:57:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-12-24 13:57:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-12-24 13:57:58,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:58,167 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2018-12-24 13:57:58,167 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:58,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2018-12-24 13:57:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:58,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:58,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:02,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:02,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:02,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:02,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:02,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:02,602 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:58:02,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:02,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:02,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:02,728 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:58:02,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:02,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:02,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:58:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:08,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:12,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:12,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2018-12-24 13:58:12,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:12,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-24 13:58:12,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-24 13:58:12,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2018-12-24 13:58:12,759 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2018-12-24 13:58:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:13,559 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-12-24 13:58:13,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-24 13:58:13,559 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2018-12-24 13:58:13,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:13,561 INFO L225 Difference]: With dead ends: 387 [2018-12-24 13:58:13,561 INFO L226 Difference]: Without dead ends: 386 [2018-12-24 13:58:13,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 568 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2018-12-24 13:58:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-24 13:58:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2018-12-24 13:58:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-12-24 13:58:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-12-24 13:58:13,567 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2018-12-24 13:58:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:13,567 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-12-24 13:58:13,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-24 13:58:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-12-24 13:58:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-12-24 13:58:13,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:13,569 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2018-12-24 13:58:13,570 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2018-12-24 13:58:13,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:13,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:13,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:13,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:13,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:18,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:18,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:18,131 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:18,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:18,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:18,131 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:58:18,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:58:18,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:58:18,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-24 13:58:18,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:18,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:18,848 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:58:18,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:18,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:18,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:58:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:24,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:28,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:28,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2018-12-24 13:58:28,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:28,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-24 13:58:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-24 13:58:28,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 13:58:28,918 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2018-12-24 13:58:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:29,780 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-12-24 13:58:29,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-24 13:58:29,783 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2018-12-24 13:58:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:29,784 INFO L225 Difference]: With dead ends: 391 [2018-12-24 13:58:29,784 INFO L226 Difference]: Without dead ends: 390 [2018-12-24 13:58:29,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 574 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 13:58:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-12-24 13:58:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2018-12-24 13:58:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-12-24 13:58:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-12-24 13:58:29,791 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2018-12-24 13:58:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:29,791 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-12-24 13:58:29,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-24 13:58:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-12-24 13:58:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-12-24 13:58:29,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:29,793 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2018-12-24 13:58:29,793 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:29,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:29,794 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2018-12-24 13:58:29,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:29,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:29,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:29,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:29,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:34,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:34,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:34,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:34,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:34,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:34,582 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:58:34,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:58:34,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:58:34,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:58:34,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:34,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:34,738 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:58:34,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:34,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:34,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:58:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:40,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:44,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:44,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2018-12-24 13:58:44,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:44,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-12-24 13:58:44,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-12-24 13:58:44,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2018-12-24 13:58:44,913 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2018-12-24 13:58:45,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:45,785 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-12-24 13:58:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-24 13:58:45,786 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2018-12-24 13:58:45,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:45,787 INFO L225 Difference]: With dead ends: 395 [2018-12-24 13:58:45,787 INFO L226 Difference]: Without dead ends: 394 [2018-12-24 13:58:45,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 580 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2018-12-24 13:58:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-12-24 13:58:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2018-12-24 13:58:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-24 13:58:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-12-24 13:58:45,794 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2018-12-24 13:58:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:45,795 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-12-24 13:58:45,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-12-24 13:58:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-12-24 13:58:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-12-24 13:58:45,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:45,796 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2018-12-24 13:58:45,796 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:45,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2018-12-24 13:58:45,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:45,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:45,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:45,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:45,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:50,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:50,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:50,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:50,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:50,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:50,283 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:58:50,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:50,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:50,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:50,410 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:58:50,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:50,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:50,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:58:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:55,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:00,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:00,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2018-12-24 13:59:00,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:00,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-12-24 13:59:00,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-12-24 13:59:00,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 13:59:00,448 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2018-12-24 13:59:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:01,252 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2018-12-24 13:59:01,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-24 13:59:01,252 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2018-12-24 13:59:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:01,254 INFO L225 Difference]: With dead ends: 399 [2018-12-24 13:59:01,254 INFO L226 Difference]: Without dead ends: 398 [2018-12-24 13:59:01,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 586 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 13:59:01,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-12-24 13:59:01,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2018-12-24 13:59:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-24 13:59:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2018-12-24 13:59:01,261 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2018-12-24 13:59:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:01,262 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2018-12-24 13:59:01,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-12-24 13:59:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2018-12-24 13:59:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-12-24 13:59:01,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:01,263 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2018-12-24 13:59:01,263 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:01,264 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2018-12-24 13:59:01,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:01,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:01,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:01,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:05,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:05,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:05,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:05,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:05,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:05,848 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:59:05,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:59:05,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:59:06,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2018-12-24 13:59:06,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:59:06,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:06,624 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:59:06,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:06,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:06,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:59:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:12,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:17,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:17,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2018-12-24 13:59:17,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:17,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-12-24 13:59:17,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-12-24 13:59:17,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2018-12-24 13:59:17,253 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2018-12-24 13:59:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:18,067 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-12-24 13:59:18,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-24 13:59:18,067 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2018-12-24 13:59:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:18,069 INFO L225 Difference]: With dead ends: 403 [2018-12-24 13:59:18,070 INFO L226 Difference]: Without dead ends: 402 [2018-12-24 13:59:18,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 592 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2018-12-24 13:59:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-24 13:59:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2018-12-24 13:59:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-12-24 13:59:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-12-24 13:59:18,078 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2018-12-24 13:59:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:18,079 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-12-24 13:59:18,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-12-24 13:59:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-12-24 13:59:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-12-24 13:59:18,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:18,081 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2018-12-24 13:59:18,082 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:18,082 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2018-12-24 13:59:18,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:18,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:18,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:18,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:18,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:22,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:22,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:22,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:22,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:22,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:22,991 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:59:22,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:59:22,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:59:23,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:59:23,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:59:23,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:23,173 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:59:23,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:23,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:23,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:59:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:28,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:33,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:33,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2018-12-24 13:59:33,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:33,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-12-24 13:59:33,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-12-24 13:59:33,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 13:59:33,455 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2018-12-24 13:59:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:34,359 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-12-24 13:59:34,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-24 13:59:34,359 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2018-12-24 13:59:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:34,361 INFO L225 Difference]: With dead ends: 407 [2018-12-24 13:59:34,362 INFO L226 Difference]: Without dead ends: 406 [2018-12-24 13:59:34,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 599 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 13:59:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-12-24 13:59:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2018-12-24 13:59:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-12-24 13:59:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2018-12-24 13:59:34,369 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2018-12-24 13:59:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:34,369 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2018-12-24 13:59:34,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-12-24 13:59:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2018-12-24 13:59:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-12-24 13:59:34,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:34,372 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2018-12-24 13:59:34,372 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:34,372 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2018-12-24 13:59:34,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:34,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:34,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:34,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:34,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:39,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:39,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:39,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:39,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:39,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:39,338 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:59:39,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:39,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:39,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:39,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:44,484 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:44,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:44,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 104 [2018-12-24 13:59:44,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:44,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-24 13:59:44,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-24 13:59:44,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2018-12-24 13:59:44,506 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 105 states. [2018-12-24 13:59:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:45,892 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2018-12-24 13:59:45,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-24 13:59:45,892 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 404 [2018-12-24 13:59:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:45,894 INFO L225 Difference]: With dead ends: 408 [2018-12-24 13:59:45,894 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 13:59:45,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 706 SyntacticMatches, 100 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5643 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=5362, Invalid=5768, Unknown=0, NotChecked=0, Total=11130 [2018-12-24 13:59:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 13:59:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 13:59:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 13:59:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 13:59:45,897 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2018-12-24 13:59:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:45,898 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 13:59:45,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-24 13:59:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 13:59:45,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 13:59:45,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 13:59:48,963 WARN L181 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2018-12-24 13:59:48,969 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 3 24) no Hoare annotation was computed. [2018-12-24 13:59:48,969 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 17) no Hoare annotation was computed. [2018-12-24 13:59:48,969 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3 24) no Hoare annotation was computed. [2018-12-24 13:59:48,969 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-12-24 13:59:48,969 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-12-24 13:59:48,969 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2018-12-24 13:59:48,971 INFO L444 ceAbstractionStarter]: At program point L13-1(lines 13 22) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 0) .cse0 (= main_p.offset main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2018-12-24 13:59:48,972 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 3 24) no Hoare annotation was computed. [2018-12-24 13:59:49,042 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:59:49 BoogieIcfgContainer [2018-12-24 13:59:49,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 13:59:49,046 INFO L168 Benchmark]: Toolchain (without parser) took 755432.32 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 826.3 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -247.6 MB). Peak memory consumption was 988.2 MB. Max. memory is 7.1 GB. [2018-12-24 13:59:49,046 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:59:49,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:59:49,047 INFO L168 Benchmark]: Boogie Preprocessor took 32.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:59:49,047 INFO L168 Benchmark]: RCFGBuilder took 307.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 13:59:49,047 INFO L168 Benchmark]: TraceAbstraction took 755019.01 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 826.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -268.7 MB). Peak memory consumption was 967.0 MB. Max. memory is 7.1 GB. [2018-12-24 13:59:49,049 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 307.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 755019.01 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 826.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -268.7 MB). Peak memory consumption was 967.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 0 && 400 <= #length[q!base]) && p!offset == q!offset)) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 754.8s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 44.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 7610 SDslu, 7951 SDs, 0 SdLazy, 28139 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46154 GetRequests, 30803 SyntacticMatches, 2649 SemanticMatches, 12702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303267 ImplicationChecksByTransitivity, 644.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 14.5s SatisfiabilityAnalysisTime, 679.2s InterpolantComputationTime, 41204 NumberOfCodeBlocks, 41204 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 61503 ConstructedInterpolants, 0 QuantifiedInterpolants, 126003756 SizeOfPredicates, 596 NumberOfNonLiveVariables, 37650 ConjunctsInSsa, 15943 ConjunctsInUnsatCore, 301 InterpolantComputations, 1 PerfectInterpolantSequences, 59603/2045250 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...