java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:56:34,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:56:34,497 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:56:34,509 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:56:34,509 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:56:34,510 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:56:34,512 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:56:34,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:56:34,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:56:34,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:56:34,520 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:56:34,520 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:56:34,521 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:56:34,525 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:56:34,527 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:56:34,527 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:56:34,529 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:56:34,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:56:34,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:56:34,543 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:56:34,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:56:34,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:56:34,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:56:34,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:56:34,552 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:56:34,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:56:34,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:56:34,554 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:56:34,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:56:34,558 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:56:34,559 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:56:34,559 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:56:34,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:56:34,560 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:56:34,561 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:56:34,561 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:56:34,562 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-18 09:56:34,574 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:56:34,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:56:34,575 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:56:34,576 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:56:34,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:56:34,576 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:56:34,576 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:56:34,576 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:56:34,577 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:56:34,577 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 09:56:34,577 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 09:56:34,577 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:56:34,577 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:56:34,578 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:56:34,578 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:56:34,578 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:56:34,579 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:56:34,579 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:56:34,579 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:56:34,579 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:56:34,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:56:34,580 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:56:34,580 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:56:34,580 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:56:34,580 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:56:34,580 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:56:34,580 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:56:34,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:56:34,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:56:34,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:56:34,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:56:34,582 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:56:34,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:56:34,582 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:56:34,582 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:56:34,582 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:56:34,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:56:34,583 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:56:34,583 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:56:34,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:56:34,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:56:34,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:56:34,646 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:56:34,647 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:56:34,647 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-02-18 09:56:34,648 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-02-18 09:56:34,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:56:34,700 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:56:34,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:56:34,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:56:34,701 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:56:34,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:56:34" (1/1) ... [2019-02-18 09:56:34,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:56:34" (1/1) ... [2019-02-18 09:56:34,737 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-18 09:56:34,737 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-18 09:56:34,737 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-18 09:56:34,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:56:34,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:56:34,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:56:34,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:56:34,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:56:34" (1/1) ... [2019-02-18 09:56:34,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:56:34" (1/1) ... [2019-02-18 09:56:34,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:56:34" (1/1) ... [2019-02-18 09:56:34,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:56:34" (1/1) ... [2019-02-18 09:56:34,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:56:34" (1/1) ... [2019-02-18 09:56:34,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:56:34" (1/1) ... [2019-02-18 09:56:34,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:56:34" (1/1) ... [2019-02-18 09:56:34,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:56:34,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:56:34,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:56:34,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:56:34,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:56:34" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:56:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-18 09:56:34,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-18 09:56:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-18 09:56:35,150 INFO L278 CfgBuilder]: Using library mode [2019-02-18 09:56:35,151 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-18 09:56:35,152 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:56:35 BoogieIcfgContainer [2019-02-18 09:56:35,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:56:35,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:56:35,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:56:35,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:56:35,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:56:34" (1/2) ... [2019-02-18 09:56:35,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee76070 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:56:35, skipping insertion in model container [2019-02-18 09:56:35,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:56:35" (2/2) ... [2019-02-18 09:56:35,172 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-02-18 09:56:35,191 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:56:35,200 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:56:35,247 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:56:35,319 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:56:35,319 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:56:35,319 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:56:35,320 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:56:35,320 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:56:35,320 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:56:35,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:56:35,320 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:56:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-02-18 09:56:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:56:35,344 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:35,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:56:35,348 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:35,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-02-18 09:56:35,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:35,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:35,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:35,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:35,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:35,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:56:35,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:56:35,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:56:35,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:56:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:56:35,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:56:35,580 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-02-18 09:56:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:35,635 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-02-18 09:56:35,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:56:35,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 09:56:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:35,650 INFO L225 Difference]: With dead ends: 17 [2019-02-18 09:56:35,651 INFO L226 Difference]: Without dead ends: 10 [2019-02-18 09:56:35,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:56:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-18 09:56:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-02-18 09:56:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-18 09:56:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-18 09:56:35,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-02-18 09:56:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:35,690 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-18 09:56:35,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:56:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-18 09:56:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:56:35,691 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:35,691 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-18 09:56:35,691 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:35,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:35,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2019-02-18 09:56:35,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:35,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:35,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:35,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:35,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:35,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:35,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:35,881 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:56:35,883 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2019-02-18 09:56:35,957 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 09:56:35,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:56:54,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:56:54,772 INFO L272 AbstractInterpreter]: Visited 6 different actions 71 times. Merged at 5 different actions 65 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:56:54,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:54,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:56:54,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:54,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:54,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:54,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:56:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:54,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:54,893 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 [2019-02-18 09:56:54,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:54,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:54,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:56:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:55,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:55,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:55,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:56:55,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:55,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:56:55,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:56:55,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:56:55,158 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-02-18 09:56:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:55,301 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-18 09:56:55,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:56:55,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-02-18 09:56:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:55,303 INFO L225 Difference]: With dead ends: 15 [2019-02-18 09:56:55,303 INFO L226 Difference]: Without dead ends: 14 [2019-02-18 09:56:55,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:56:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-18 09:56:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-18 09:56:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:56:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-18 09:56:55,309 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-02-18 09:56:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:55,309 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-18 09:56:55,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:56:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-18 09:56:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-18 09:56:55,312 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:55,312 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-02-18 09:56:55,313 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2019-02-18 09:56:55,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:55,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:55,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:55,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:55,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:55,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:55,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:55,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:55,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:55,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:55,524 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 [2019-02-18 09:56:55,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:56:55,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:55,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:56:55,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:55,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:55,579 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 [2019-02-18 09:56:55,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:55,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:55,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:56:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:55,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:55,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:55,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:56:55,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:55,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:56:55,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:56:55,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:56:55,888 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-02-18 09:56:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:56,021 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-18 09:56:56,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:56:56,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-18 09:56:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:56,023 INFO L225 Difference]: With dead ends: 19 [2019-02-18 09:56:56,023 INFO L226 Difference]: Without dead ends: 18 [2019-02-18 09:56:56,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:56:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-18 09:56:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-02-18 09:56:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:56:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-18 09:56:56,029 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-02-18 09:56:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:56,029 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-18 09:56:56,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:56:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-18 09:56:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-18 09:56:56,030 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:56,030 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-02-18 09:56:56,030 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:56,030 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2019-02-18 09:56:56,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:56,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:56,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:56,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:56,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:56,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:56,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:56,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:56,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:56,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:56,150 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 [2019-02-18 09:56:56,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:56:56,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:56:56,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:56:56,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:56,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:56,191 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 [2019-02-18 09:56:56,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:56,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:56,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:56:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:56,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:56,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:56,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:56:56,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:56,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:56:56,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:56:56,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:56:56,414 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-02-18 09:56:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:56,742 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-18 09:56:56,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:56:56,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-02-18 09:56:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:56,743 INFO L225 Difference]: With dead ends: 23 [2019-02-18 09:56:56,744 INFO L226 Difference]: Without dead ends: 22 [2019-02-18 09:56:56,744 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 [2019-02-18 09:56:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-18 09:56:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-18 09:56:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-18 09:56:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-18 09:56:56,749 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-02-18 09:56:56,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:56,749 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-18 09:56:56,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:56:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-18 09:56:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-18 09:56:56,750 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:56,750 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-02-18 09:56:56,750 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:56,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:56,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2019-02-18 09:56:56,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:56,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:56,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:56,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:56,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:56,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:56,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:56,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:56,884 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:56,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:56,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:56:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:56,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:56,937 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 [2019-02-18 09:56:56,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:56,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:56,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:56:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:57,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:57,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:57,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:56:57,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:57,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:56:57,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:56:57,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:56:57,495 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-02-18 09:56:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:57,566 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-18 09:56:57,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:56:57,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-02-18 09:56:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:57,567 INFO L225 Difference]: With dead ends: 27 [2019-02-18 09:56:57,568 INFO L226 Difference]: Without dead ends: 26 [2019-02-18 09:56:57,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:56:57,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-18 09:56:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-02-18 09:56:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-18 09:56:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-18 09:56:57,574 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-02-18 09:56:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:57,574 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-18 09:56:57,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:56:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-18 09:56:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-18 09:56:57,575 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:57,575 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-02-18 09:56:57,577 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2019-02-18 09:56:57,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:57,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:57,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:57,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:57,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:57,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:57,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:57,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:57,713 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 [2019-02-18 09:56:57,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:56:57,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:57,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-18 09:56:57,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:57,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:57,747 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 [2019-02-18 09:56:57,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:57,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:57,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:56:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:57,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:58,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:58,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-18 09:56:58,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:58,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:56:58,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:56:58,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:56:58,090 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-02-18 09:56:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:58,153 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-18 09:56:58,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:56:58,159 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-02-18 09:56:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:58,160 INFO L225 Difference]: With dead ends: 31 [2019-02-18 09:56:58,160 INFO L226 Difference]: Without dead ends: 30 [2019-02-18 09:56:58,160 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 [2019-02-18 09:56:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-18 09:56:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-02-18 09:56:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-18 09:56:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-18 09:56:58,164 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-02-18 09:56:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:58,165 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-18 09:56:58,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:56:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-18 09:56:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-18 09:56:58,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:58,166 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-02-18 09:56:58,166 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:58,167 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2019-02-18 09:56:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:58,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:58,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:58,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:58,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:58,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:58,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:58,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:58,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:58,290 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 [2019-02-18 09:56:58,301 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:56:58,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:56:58,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:56:58,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:58,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:58,324 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 [2019-02-18 09:56:58,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:58,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:58,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:56:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:58,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:58,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:58,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-18 09:56:58,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:58,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-18 09:56:58,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-18 09:56:58,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:56:58,614 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-02-18 09:56:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:58,698 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-18 09:56:58,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:56:58,700 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-02-18 09:56:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:58,702 INFO L225 Difference]: With dead ends: 35 [2019-02-18 09:56:58,702 INFO L226 Difference]: Without dead ends: 34 [2019-02-18 09:56:58,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:56:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-18 09:56:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-02-18 09:56:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 09:56:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-18 09:56:58,707 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-02-18 09:56:58,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:58,708 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-18 09:56:58,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-18 09:56:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-18 09:56:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-18 09:56:58,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:58,709 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-02-18 09:56:58,709 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:58,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2019-02-18 09:56:58,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:58,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:58,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:58,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:58,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:58,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:58,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:58,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:58,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:58,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:58,825 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 [2019-02-18 09:56:58,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:58,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:56:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:58,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:58,862 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 [2019-02-18 09:56:58,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:58,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:58,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:56:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:59,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:59,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:59,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-18 09:56:59,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:59,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-18 09:56:59,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-18 09:56:59,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:56:59,199 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-02-18 09:56:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:59,390 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-18 09:56:59,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:56:59,391 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-02-18 09:56:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:59,393 INFO L225 Difference]: With dead ends: 39 [2019-02-18 09:56:59,393 INFO L226 Difference]: Without dead ends: 38 [2019-02-18 09:56:59,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:56:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-18 09:56:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-02-18 09:56:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:56:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-18 09:56:59,399 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-02-18 09:56:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:59,399 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-18 09:56:59,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-18 09:56:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-18 09:56:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-18 09:56:59,400 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:59,400 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-02-18 09:56:59,401 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:59,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:59,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2019-02-18 09:56:59,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:59,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:59,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:59,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:59,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:59,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:59,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:59,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:59,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:59,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:59,533 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 [2019-02-18 09:56:59,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:56:59,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:59,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-18 09:56:59,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:59,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:59,572 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 [2019-02-18 09:56:59,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:59,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:59,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:56:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:59,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:00,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:00,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-18 09:57:00,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:00,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-18 09:57:00,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-18 09:57:00,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-18 09:57:00,133 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-02-18 09:57:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:00,255 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-18 09:57:00,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:57:00,256 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-02-18 09:57:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:00,257 INFO L225 Difference]: With dead ends: 43 [2019-02-18 09:57:00,257 INFO L226 Difference]: Without dead ends: 42 [2019-02-18 09:57:00,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-18 09:57:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-18 09:57:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-02-18 09:57:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:57:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-18 09:57:00,264 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-02-18 09:57:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:00,265 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-18 09:57:00,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-18 09:57:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-18 09:57:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-18 09:57:00,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:00,266 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-02-18 09:57:00,266 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2019-02-18 09:57:00,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:00,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:00,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:00,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:00,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:00,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:00,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:00,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:00,462 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 [2019-02-18 09:57:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:00,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:00,487 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:00,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:00,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:00,498 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 [2019-02-18 09:57:00,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:00,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:00,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:00,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:00,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:00,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-18 09:57:00,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:00,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-18 09:57:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-18 09:57:00,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:57:00,878 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-02-18 09:57:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:00,960 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-18 09:57:00,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:57:00,960 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-02-18 09:57:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:00,962 INFO L225 Difference]: With dead ends: 47 [2019-02-18 09:57:00,962 INFO L226 Difference]: Without dead ends: 46 [2019-02-18 09:57:00,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:57:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-18 09:57:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-02-18 09:57:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-18 09:57:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-18 09:57:00,969 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-02-18 09:57:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:00,969 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-18 09:57:00,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-18 09:57:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-18 09:57:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-18 09:57:00,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:00,970 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-02-18 09:57:00,970 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:00,971 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2019-02-18 09:57:00,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:00,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:00,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:00,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:00,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:01,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:01,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:01,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:01,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:01,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:01,244 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 [2019-02-18 09:57:01,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:01,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:01,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:01,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 [2019-02-18 09:57:01,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:01,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:01,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:01,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:01,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:01,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-18 09:57:01,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:01,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-18 09:57:01,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-18 09:57:01,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-18 09:57:01,680 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-02-18 09:57:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:01,775 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-18 09:57:01,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 09:57:01,775 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-02-18 09:57:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:01,777 INFO L225 Difference]: With dead ends: 51 [2019-02-18 09:57:01,777 INFO L226 Difference]: Without dead ends: 50 [2019-02-18 09:57:01,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-18 09:57:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-18 09:57:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-02-18 09:57:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-18 09:57:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-18 09:57:01,783 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-02-18 09:57:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:01,784 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-18 09:57:01,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-18 09:57:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-18 09:57:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-18 09:57:01,785 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:01,785 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-02-18 09:57:01,785 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:01,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:01,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2019-02-18 09:57:01,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:01,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:01,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:01,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:01,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:01,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:01,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:01,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:01,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:01,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:01,987 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 [2019-02-18 09:57:01,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:01,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:02,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-18 09:57:02,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:02,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:02,047 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 [2019-02-18 09:57:02,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:02,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:02,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:02,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:02,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:02,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-18 09:57:02,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:02,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:57:02,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:57:02,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:57:02,830 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-02-18 09:57:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:02,934 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-18 09:57:02,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-18 09:57:02,934 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-02-18 09:57:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:02,935 INFO L225 Difference]: With dead ends: 55 [2019-02-18 09:57:02,936 INFO L226 Difference]: Without dead ends: 54 [2019-02-18 09:57:02,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:57:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-18 09:57:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-02-18 09:57:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-18 09:57:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-18 09:57:02,942 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-02-18 09:57:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:02,942 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-18 09:57:02,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:57:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-18 09:57:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-18 09:57:02,943 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:02,943 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-02-18 09:57:02,944 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:02,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:02,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2019-02-18 09:57:02,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:02,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:02,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:02,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:02,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:03,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:03,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:03,383 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:03,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:03,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:03,383 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 [2019-02-18 09:57:03,391 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:03,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:03,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:03,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:03,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:03,429 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 [2019-02-18 09:57:03,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:03,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:03,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:03,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:03,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:03,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-18 09:57:03,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:03,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-18 09:57:03,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-18 09:57:03,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-18 09:57:03,973 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-02-18 09:57:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:04,073 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-18 09:57:04,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:57:04,074 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-02-18 09:57:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:04,075 INFO L225 Difference]: With dead ends: 59 [2019-02-18 09:57:04,075 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 09:57:04,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-18 09:57:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 09:57:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-02-18 09:57:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-18 09:57:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-18 09:57:04,082 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-02-18 09:57:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:04,083 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-18 09:57:04,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-18 09:57:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-18 09:57:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-18 09:57:04,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:04,084 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-02-18 09:57:04,084 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:04,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:04,084 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2019-02-18 09:57:04,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:04,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:04,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:04,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:04,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:04,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:04,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:04,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:04,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:04,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:04,786 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 [2019-02-18 09:57:04,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:04,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:04,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:04,828 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 [2019-02-18 09:57:04,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:04,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:04,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:05,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:05,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:05,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-18 09:57:05,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:05,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-18 09:57:05,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-18 09:57:05,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:57:05,947 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-02-18 09:57:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:06,163 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-18 09:57:06,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:57:06,163 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-02-18 09:57:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:06,165 INFO L225 Difference]: With dead ends: 63 [2019-02-18 09:57:06,165 INFO L226 Difference]: Without dead ends: 62 [2019-02-18 09:57:06,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:57:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-18 09:57:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-02-18 09:57:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:57:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-18 09:57:06,171 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-02-18 09:57:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:06,171 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-18 09:57:06,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-18 09:57:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-18 09:57:06,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-18 09:57:06,172 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:06,172 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-02-18 09:57:06,173 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2019-02-18 09:57:06,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:06,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:06,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:06,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:06,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:06,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:06,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:06,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:06,534 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 [2019-02-18 09:57:06,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:06,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:06,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-18 09:57:06,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:06,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:06,586 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 [2019-02-18 09:57:06,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:06,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:06,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:07,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:08,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:08,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-18 09:57:08,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:08,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:57:08,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:57:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-18 09:57:08,185 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-02-18 09:57:08,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:08,380 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-18 09:57:08,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-18 09:57:08,380 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-02-18 09:57:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:08,381 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:57:08,381 INFO L226 Difference]: Without dead ends: 66 [2019-02-18 09:57:08,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-18 09:57:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-18 09:57:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-02-18 09:57:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-18 09:57:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-18 09:57:08,390 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-02-18 09:57:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:08,391 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-18 09:57:08,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:57:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-18 09:57:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-18 09:57:08,396 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:08,396 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-02-18 09:57:08,396 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2019-02-18 09:57:08,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:08,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:08,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:08,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:08,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:09,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:09,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:09,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:09,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:09,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:09,147 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 [2019-02-18 09:57:09,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:09,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:09,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:09,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:09,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:09,189 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 [2019-02-18 09:57:09,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:09,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:09,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:09,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:09,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:09,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-18 09:57:09,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:09,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-18 09:57:09,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-18 09:57:09,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:57:09,863 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-02-18 09:57:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:09,997 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-18 09:57:09,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:57:09,997 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-02-18 09:57:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:09,998 INFO L225 Difference]: With dead ends: 71 [2019-02-18 09:57:09,998 INFO L226 Difference]: Without dead ends: 70 [2019-02-18 09:57:10,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:57:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-18 09:57:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-02-18 09:57:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-18 09:57:10,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-18 09:57:10,010 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-02-18 09:57:10,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:10,010 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-18 09:57:10,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-18 09:57:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-18 09:57:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-18 09:57:10,012 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:10,012 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-02-18 09:57:10,012 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:10,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:10,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2019-02-18 09:57:10,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:10,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:10,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:10,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:10,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:10,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:10,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:10,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:10,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:10,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:10,262 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 [2019-02-18 09:57:10,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:10,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:10,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:10,316 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 [2019-02-18 09:57:10,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:10,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:10,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:10,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:11,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:11,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-18 09:57:11,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:11,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-18 09:57:11,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-18 09:57:11,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-18 09:57:11,395 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-02-18 09:57:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:11,501 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-18 09:57:11,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:57:11,502 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-02-18 09:57:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:11,503 INFO L225 Difference]: With dead ends: 75 [2019-02-18 09:57:11,503 INFO L226 Difference]: Without dead ends: 74 [2019-02-18 09:57:11,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-18 09:57:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-18 09:57:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-02-18 09:57:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:57:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-18 09:57:11,510 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-02-18 09:57:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:11,510 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-18 09:57:11,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-18 09:57:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-18 09:57:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-18 09:57:11,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:11,511 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-02-18 09:57:11,511 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:11,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2019-02-18 09:57:11,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:11,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:11,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:11,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:11,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:11,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:11,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:11,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:11,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:11,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:11,785 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 [2019-02-18 09:57:11,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:11,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:11,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-18 09:57:11,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:11,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:11,842 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 [2019-02-18 09:57:11,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:11,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:11,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:12,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:12,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:12,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-18 09:57:12,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:12,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:57:12,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:57:12,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:57:12,979 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-02-18 09:57:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:13,120 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-18 09:57:13,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:57:13,121 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-02-18 09:57:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:13,122 INFO L225 Difference]: With dead ends: 79 [2019-02-18 09:57:13,122 INFO L226 Difference]: Without dead ends: 78 [2019-02-18 09:57:13,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:57:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-18 09:57:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-02-18 09:57:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:57:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-18 09:57:13,127 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-02-18 09:57:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:13,127 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-18 09:57:13,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:57:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-18 09:57:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-18 09:57:13,128 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:13,128 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-02-18 09:57:13,128 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2019-02-18 09:57:13,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:13,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:13,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:13,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:13,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:13,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:13,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:13,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:13,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:13,477 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 [2019-02-18 09:57:13,486 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:13,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:13,511 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:13,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:13,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:13,516 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 [2019-02-18 09:57:13,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:13,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:13,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:13,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:14,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:14,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-18 09:57:14,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:14,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-18 09:57:14,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-18 09:57:14,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-18 09:57:14,487 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-02-18 09:57:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:14,654 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-18 09:57:14,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-18 09:57:14,654 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-02-18 09:57:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:14,655 INFO L225 Difference]: With dead ends: 83 [2019-02-18 09:57:14,656 INFO L226 Difference]: Without dead ends: 82 [2019-02-18 09:57:14,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-18 09:57:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-18 09:57:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-02-18 09:57:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-18 09:57:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-18 09:57:14,661 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-02-18 09:57:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:14,661 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-18 09:57:14,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-18 09:57:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-18 09:57:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-18 09:57:14,662 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:14,662 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-02-18 09:57:14,662 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:14,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2019-02-18 09:57:14,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:14,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:14,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:15,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:15,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:15,057 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:15,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:15,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:15,057 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 [2019-02-18 09:57:15,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:15,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:15,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:15,108 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 [2019-02-18 09:57:15,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:15,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:15,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:15,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:16,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:16,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-18 09:57:16,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:16,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-18 09:57:16,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-18 09:57:16,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:57:16,055 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-02-18 09:57:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:16,184 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-18 09:57:16,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:57:16,185 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-02-18 09:57:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:16,186 INFO L225 Difference]: With dead ends: 87 [2019-02-18 09:57:16,186 INFO L226 Difference]: Without dead ends: 86 [2019-02-18 09:57:16,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:57:16,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-18 09:57:16,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-02-18 09:57:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-18 09:57:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-18 09:57:16,192 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-02-18 09:57:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:16,192 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-18 09:57:16,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-18 09:57:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-18 09:57:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-18 09:57:16,193 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:16,193 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-02-18 09:57:16,193 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:16,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:16,194 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2019-02-18 09:57:16,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:16,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:16,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:16,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:16,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:17,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:17,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:17,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:17,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:17,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:17,083 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 [2019-02-18 09:57:17,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:17,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:17,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-18 09:57:17,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:17,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:17,163 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 [2019-02-18 09:57:17,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:17,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:17,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:17,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:18,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:18,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-18 09:57:18,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:18,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:57:18,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:57:18,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-18 09:57:18,499 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-02-18 09:57:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:18,804 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-18 09:57:18,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-18 09:57:18,804 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-02-18 09:57:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:18,806 INFO L225 Difference]: With dead ends: 91 [2019-02-18 09:57:18,806 INFO L226 Difference]: Without dead ends: 90 [2019-02-18 09:57:18,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-18 09:57:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-18 09:57:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-02-18 09:57:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-18 09:57:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-18 09:57:18,811 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-02-18 09:57:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:18,812 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-18 09:57:18,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:57:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-18 09:57:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-18 09:57:18,812 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:18,812 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-02-18 09:57:18,812 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:18,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:18,813 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2019-02-18 09:57:18,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:18,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:18,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:18,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:18,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:19,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:19,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:19,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:19,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:19,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:19,162 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 [2019-02-18 09:57:19,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:19,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:19,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:19,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:19,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:19,225 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 [2019-02-18 09:57:19,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:19,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:19,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:19,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:20,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:20,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-18 09:57:20,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:20,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-18 09:57:20,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-18 09:57:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:57:20,294 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-02-18 09:57:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:20,472 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-18 09:57:20,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-18 09:57:20,475 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-02-18 09:57:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:20,477 INFO L225 Difference]: With dead ends: 95 [2019-02-18 09:57:20,477 INFO L226 Difference]: Without dead ends: 94 [2019-02-18 09:57:20,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:57:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-18 09:57:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-02-18 09:57:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-18 09:57:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-18 09:57:20,481 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-02-18 09:57:20,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:20,482 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-18 09:57:20,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-18 09:57:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-18 09:57:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-18 09:57:20,482 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:20,483 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-02-18 09:57:20,483 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:20,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2019-02-18 09:57:20,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:20,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:20,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:20,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:20,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:20,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:20,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:20,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:20,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:20,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:20,887 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 [2019-02-18 09:57:20,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:20,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:20,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:20,932 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 [2019-02-18 09:57:20,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:20,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:20,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:21,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:22,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:22,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-18 09:57:22,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:22,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-18 09:57:22,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-18 09:57:22,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-18 09:57:22,091 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-02-18 09:57:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:22,241 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-18 09:57:22,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-18 09:57:22,246 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-02-18 09:57:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:22,246 INFO L225 Difference]: With dead ends: 99 [2019-02-18 09:57:22,246 INFO L226 Difference]: Without dead ends: 98 [2019-02-18 09:57:22,247 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 [2019-02-18 09:57:22,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-18 09:57:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-02-18 09:57:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-18 09:57:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-18 09:57:22,251 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-02-18 09:57:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:22,251 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-18 09:57:22,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-18 09:57:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-18 09:57:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-18 09:57:22,252 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:22,252 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-02-18 09:57:22,252 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:22,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:22,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2019-02-18 09:57:22,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:22,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:22,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:22,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:22,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:22,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:22,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:22,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:22,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:22,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:22,674 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 [2019-02-18 09:57:22,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:22,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:22,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-18 09:57:22,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:22,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:22,755 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 [2019-02-18 09:57:22,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:22,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:22,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:23,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:24,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:24,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-18 09:57:24,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:24,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:57:24,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:57:24,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:57:24,186 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-02-18 09:57:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:24,370 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-18 09:57:24,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:57:24,370 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-02-18 09:57:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:24,372 INFO L225 Difference]: With dead ends: 103 [2019-02-18 09:57:24,372 INFO L226 Difference]: Without dead ends: 102 [2019-02-18 09:57:24,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:57:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-18 09:57:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-02-18 09:57:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-18 09:57:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-18 09:57:24,378 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-02-18 09:57:24,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:24,378 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-18 09:57:24,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:57:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-18 09:57:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-18 09:57:24,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:24,379 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-02-18 09:57:24,379 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:24,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2019-02-18 09:57:24,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:24,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:24,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:24,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:24,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:24,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:24,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:24,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:24,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:24,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:24,940 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 [2019-02-18 09:57:24,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:24,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:24,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:24,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:24,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:25,013 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 [2019-02-18 09:57:25,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:25,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:25,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:25,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:26,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:26,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-18 09:57:26,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:26,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-18 09:57:26,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-18 09:57:26,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-18 09:57:26,340 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-02-18 09:57:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:26,551 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-18 09:57:26,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:57:26,551 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-02-18 09:57:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:26,552 INFO L225 Difference]: With dead ends: 107 [2019-02-18 09:57:26,553 INFO L226 Difference]: Without dead ends: 106 [2019-02-18 09:57:26,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-18 09:57:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-18 09:57:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-02-18 09:57:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-18 09:57:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-18 09:57:26,558 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-02-18 09:57:26,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:26,559 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-18 09:57:26,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-18 09:57:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-18 09:57:26,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-18 09:57:26,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:26,560 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-02-18 09:57:26,560 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:26,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:26,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2019-02-18 09:57:26,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:26,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:26,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:26,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:26,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:27,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:27,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:27,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:27,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:27,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:27,982 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 [2019-02-18 09:57:27,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:27,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:28,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:28,029 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 [2019-02-18 09:57:28,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:28,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:28,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:28,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:29,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:29,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-18 09:57:29,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:29,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-18 09:57:29,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-18 09:57:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:57:29,754 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-02-18 09:57:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:29,956 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-18 09:57:29,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-18 09:57:29,957 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-02-18 09:57:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:29,958 INFO L225 Difference]: With dead ends: 111 [2019-02-18 09:57:29,958 INFO L226 Difference]: Without dead ends: 110 [2019-02-18 09:57:29,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:57:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-18 09:57:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-02-18 09:57:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-18 09:57:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-18 09:57:29,964 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-02-18 09:57:29,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:29,964 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-18 09:57:29,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-18 09:57:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-18 09:57:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-18 09:57:29,965 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:29,965 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-02-18 09:57:29,965 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:29,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:29,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2019-02-18 09:57:29,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:29,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:29,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:29,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:29,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:30,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:30,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:30,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:30,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:30,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:30,453 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 [2019-02-18 09:57:30,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:30,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:30,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-18 09:57:30,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:30,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:30,539 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 [2019-02-18 09:57:30,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:30,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:30,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:31,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:32,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:32,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-18 09:57:32,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:32,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-18 09:57:32,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-18 09:57:32,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-18 09:57:32,028 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-02-18 09:57:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:32,211 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-18 09:57:32,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-18 09:57:32,212 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-02-18 09:57:32,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:32,213 INFO L225 Difference]: With dead ends: 115 [2019-02-18 09:57:32,213 INFO L226 Difference]: Without dead ends: 114 [2019-02-18 09:57:32,215 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 [2019-02-18 09:57:32,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-18 09:57:32,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-02-18 09:57:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-18 09:57:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-18 09:57:32,219 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-02-18 09:57:32,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:32,219 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-18 09:57:32,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-18 09:57:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-18 09:57:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-18 09:57:32,220 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:32,220 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-02-18 09:57:32,220 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:32,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:32,221 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2019-02-18 09:57:32,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:32,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:32,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:32,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:32,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:32,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:32,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:32,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:32,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:32,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:32,934 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 [2019-02-18 09:57:32,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:32,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:32,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:32,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:32,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:32,998 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 [2019-02-18 09:57:32,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:33,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:33,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:33,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:34,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:34,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-18 09:57:34,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:34,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-18 09:57:34,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-18 09:57:34,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:57:34,977 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-02-18 09:57:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:35,172 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-02-18 09:57:35,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:57:35,172 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-02-18 09:57:35,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:35,174 INFO L225 Difference]: With dead ends: 119 [2019-02-18 09:57:35,174 INFO L226 Difference]: Without dead ends: 118 [2019-02-18 09:57:35,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:57:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-02-18 09:57:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-02-18 09:57:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-18 09:57:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-02-18 09:57:35,179 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-02-18 09:57:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:35,179 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-02-18 09:57:35,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-18 09:57:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-02-18 09:57:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-18 09:57:35,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:35,180 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-02-18 09:57:35,180 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:35,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:35,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2019-02-18 09:57:35,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:35,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:35,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:35,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:35,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:35,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:35,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:35,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:35,744 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 [2019-02-18 09:57:35,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:35,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:35,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:35,796 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 [2019-02-18 09:57:35,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:35,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:35,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:36,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:37,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:37,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-18 09:57:37,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:37,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-18 09:57:37,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-18 09:57:37,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-18 09:57:37,677 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-02-18 09:57:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:37,887 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-02-18 09:57:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:57:37,888 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-02-18 09:57:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:37,889 INFO L225 Difference]: With dead ends: 123 [2019-02-18 09:57:37,890 INFO L226 Difference]: Without dead ends: 122 [2019-02-18 09:57:37,891 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 [2019-02-18 09:57:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-02-18 09:57:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-02-18 09:57:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-18 09:57:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-18 09:57:37,896 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-02-18 09:57:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:37,896 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-18 09:57:37,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-18 09:57:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-18 09:57:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-18 09:57:37,897 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:37,897 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-02-18 09:57:37,897 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:37,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:37,898 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2019-02-18 09:57:37,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:37,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:37,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:37,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:37,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:38,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:38,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:38,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:38,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:38,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:38,711 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 [2019-02-18 09:57:38,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:38,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:38,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-18 09:57:38,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:38,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:38,828 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 [2019-02-18 09:57:38,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:38,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:38,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:39,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:40,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:40,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-18 09:57:40,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:40,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-18 09:57:40,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-18 09:57:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:57:40,634 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-02-18 09:57:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:40,856 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-02-18 09:57:40,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:57:40,856 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-02-18 09:57:40,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:40,858 INFO L225 Difference]: With dead ends: 127 [2019-02-18 09:57:40,858 INFO L226 Difference]: Without dead ends: 126 [2019-02-18 09:57:40,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:57:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-02-18 09:57:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-02-18 09:57:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-18 09:57:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-02-18 09:57:40,863 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-02-18 09:57:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:40,863 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-02-18 09:57:40,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-18 09:57:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-02-18 09:57:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-18 09:57:40,864 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:40,864 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-02-18 09:57:40,864 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:40,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:40,865 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2019-02-18 09:57:40,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:40,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:40,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:40,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:40,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:41,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:41,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:41,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:41,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:41,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:41,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 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 [2019-02-18 09:57:41,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:41,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:41,900 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:41,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:41,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:41,906 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 [2019-02-18 09:57:41,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:41,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:41,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:42,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:44,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:44,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-18 09:57:44,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:44,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-18 09:57:44,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-18 09:57:44,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-18 09:57:44,057 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-02-18 09:57:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:44,289 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-02-18 09:57:44,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-18 09:57:44,290 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-02-18 09:57:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:44,291 INFO L225 Difference]: With dead ends: 131 [2019-02-18 09:57:44,291 INFO L226 Difference]: Without dead ends: 130 [2019-02-18 09:57:44,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-18 09:57:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-18 09:57:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-02-18 09:57:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-18 09:57:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-02-18 09:57:44,297 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-02-18 09:57:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:44,297 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-02-18 09:57:44,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-18 09:57:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-02-18 09:57:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-18 09:57:44,298 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:44,298 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-02-18 09:57:44,299 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2019-02-18 09:57:44,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:44,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:44,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:45,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:45,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:45,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:45,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:45,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:45,485 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 [2019-02-18 09:57:45,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:45,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:45,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:45,538 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 [2019-02-18 09:57:45,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:45,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:45,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:46,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:47,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:47,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-18 09:57:47,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:47,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-18 09:57:47,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-18 09:57:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:57:47,603 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-02-18 09:57:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:47,817 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-18 09:57:47,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:57:47,818 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-02-18 09:57:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:47,819 INFO L225 Difference]: With dead ends: 135 [2019-02-18 09:57:47,819 INFO L226 Difference]: Without dead ends: 134 [2019-02-18 09:57:47,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:57:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-18 09:57:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-02-18 09:57:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-18 09:57:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-02-18 09:57:47,825 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-02-18 09:57:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:47,826 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-02-18 09:57:47,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-18 09:57:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-02-18 09:57:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-18 09:57:47,827 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:47,827 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-02-18 09:57:47,827 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:47,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:47,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2019-02-18 09:57:47,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:47,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:47,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:48,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:48,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:48,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:48,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:48,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:48,571 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 [2019-02-18 09:57:48,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:48,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:48,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-18 09:57:48,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:48,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:48,740 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 [2019-02-18 09:57:48,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:48,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:48,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:49,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:51,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:51,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-18 09:57:51,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:51,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-18 09:57:51,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-18 09:57:51,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-18 09:57:51,060 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-02-18 09:57:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:51,288 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-02-18 09:57:51,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:57:51,289 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-02-18 09:57:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:51,290 INFO L225 Difference]: With dead ends: 139 [2019-02-18 09:57:51,290 INFO L226 Difference]: Without dead ends: 138 [2019-02-18 09:57:51,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-18 09:57:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-18 09:57:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-02-18 09:57:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-18 09:57:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-02-18 09:57:51,297 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-02-18 09:57:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:51,297 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-02-18 09:57:51,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-18 09:57:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-02-18 09:57:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-18 09:57:51,298 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:51,298 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-02-18 09:57:51,298 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:51,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2019-02-18 09:57:51,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:51,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:51,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:51,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:51,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:52,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:52,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:52,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:52,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:52,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:52,115 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 [2019-02-18 09:57:52,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:52,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:52,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:52,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:52,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:52,188 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 [2019-02-18 09:57:52,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:52,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:52,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:53,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:55,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:55,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-18 09:57:55,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:55,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-18 09:57:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-18 09:57:55,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:57:55,365 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-02-18 09:57:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:55,696 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-02-18 09:57:55,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:57:55,697 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-02-18 09:57:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:55,698 INFO L225 Difference]: With dead ends: 143 [2019-02-18 09:57:55,699 INFO L226 Difference]: Without dead ends: 142 [2019-02-18 09:57:55,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:57:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-02-18 09:57:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-02-18 09:57:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-18 09:57:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-02-18 09:57:55,704 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-02-18 09:57:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:55,705 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-02-18 09:57:55,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-18 09:57:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-02-18 09:57:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-18 09:57:55,706 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:55,706 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-02-18 09:57:55,706 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:55,706 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2019-02-18 09:57:55,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:55,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:55,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:55,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:55,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:56,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:56,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:56,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:56,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:56,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:56,483 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 [2019-02-18 09:57:56,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:56,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:56,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:56,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 [2019-02-18 09:57:56,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:56,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:56,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:57,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:59,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:59,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-18 09:57:59,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:59,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-18 09:57:59,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-18 09:57:59,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-18 09:57:59,182 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-02-18 09:57:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:59,617 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-02-18 09:57:59,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:57:59,617 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-02-18 09:57:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:59,619 INFO L225 Difference]: With dead ends: 147 [2019-02-18 09:57:59,619 INFO L226 Difference]: Without dead ends: 146 [2019-02-18 09:57:59,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-18 09:57:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-18 09:57:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-02-18 09:57:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-18 09:57:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-02-18 09:57:59,624 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-02-18 09:57:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:59,625 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-02-18 09:57:59,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-18 09:57:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-02-18 09:57:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-18 09:57:59,626 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:59,626 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-02-18 09:57:59,626 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:59,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2019-02-18 09:57:59,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:59,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:59,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:59,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:00,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:00,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:00,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:00,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:00,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:00,417 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 [2019-02-18 09:58:00,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:00,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:00,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-18 09:58:00,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:00,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:00,540 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 [2019-02-18 09:58:00,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:00,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:00,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:01,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:03,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:03,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-18 09:58:03,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:03,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-18 09:58:03,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-18 09:58:03,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:58:03,131 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-02-18 09:58:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:03,564 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-02-18 09:58:03,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-18 09:58:03,564 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-02-18 09:58:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:03,566 INFO L225 Difference]: With dead ends: 151 [2019-02-18 09:58:03,566 INFO L226 Difference]: Without dead ends: 150 [2019-02-18 09:58:03,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:58:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-18 09:58:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-02-18 09:58:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-18 09:58:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-02-18 09:58:03,572 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-02-18 09:58:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:03,573 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-02-18 09:58:03,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-18 09:58:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-02-18 09:58:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-18 09:58:03,574 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:03,574 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-02-18 09:58:03,574 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:03,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:03,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2019-02-18 09:58:03,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:03,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:03,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:03,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:03,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:04,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:04,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:04,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:04,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:04,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:04,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 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 [2019-02-18 09:58:04,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:04,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:04,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:04,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:04,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:04,832 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 [2019-02-18 09:58:04,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:04,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:04,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:05,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:07,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:07,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-18 09:58:07,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:07,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-18 09:58:07,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-18 09:58:07,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-18 09:58:07,669 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-02-18 09:58:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:08,027 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-02-18 09:58:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:58:08,028 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-02-18 09:58:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:08,029 INFO L225 Difference]: With dead ends: 155 [2019-02-18 09:58:08,030 INFO L226 Difference]: Without dead ends: 154 [2019-02-18 09:58:08,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-18 09:58:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-18 09:58:08,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-02-18 09:58:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-18 09:58:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-02-18 09:58:08,036 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-02-18 09:58:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:08,037 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-02-18 09:58:08,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-18 09:58:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-02-18 09:58:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-18 09:58:08,038 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:08,038 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-02-18 09:58:08,038 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2019-02-18 09:58:08,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:08,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:08,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:08,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:09,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:09,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:09,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:09,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:09,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:09,982 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 [2019-02-18 09:58:09,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:09,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:10,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:10,061 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 [2019-02-18 09:58:10,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:10,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:10,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:11,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:13,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:13,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-18 09:58:13,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:13,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-18 09:58:13,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-18 09:58:13,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:58:13,347 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-02-18 09:58:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:13,673 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-02-18 09:58:13,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:58:13,674 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-02-18 09:58:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:13,675 INFO L225 Difference]: With dead ends: 159 [2019-02-18 09:58:13,676 INFO L226 Difference]: Without dead ends: 158 [2019-02-18 09:58:13,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:58:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-18 09:58:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-02-18 09:58:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-18 09:58:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-02-18 09:58:13,682 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-02-18 09:58:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:13,682 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-02-18 09:58:13,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-18 09:58:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-02-18 09:58:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-18 09:58:13,683 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:13,683 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-02-18 09:58:13,684 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:13,684 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2019-02-18 09:58:13,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:13,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:13,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:13,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:13,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:16,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:16,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:16,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:16,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:16,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:16,301 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 [2019-02-18 09:58:16,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:16,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:16,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-18 09:58:16,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:16,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:16,441 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 [2019-02-18 09:58:16,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:16,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:16,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:17,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:19,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:19,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-18 09:58:19,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:19,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-18 09:58:19,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-18 09:58:19,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-18 09:58:19,571 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-02-18 09:58:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:19,888 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-02-18 09:58:19,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-18 09:58:19,889 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-02-18 09:58:19,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:19,890 INFO L225 Difference]: With dead ends: 163 [2019-02-18 09:58:19,890 INFO L226 Difference]: Without dead ends: 162 [2019-02-18 09:58:19,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-18 09:58:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-02-18 09:58:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-02-18 09:58:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-18 09:58:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-02-18 09:58:19,897 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-02-18 09:58:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:19,898 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-02-18 09:58:19,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-18 09:58:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-02-18 09:58:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-18 09:58:19,899 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:19,899 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-02-18 09:58:19,899 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:19,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:19,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2019-02-18 09:58:19,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:19,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:19,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:19,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:19,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:21,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:21,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:21,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:21,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:21,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:21,753 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 [2019-02-18 09:58:21,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:21,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:21,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:21,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:21,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:21,841 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 [2019-02-18 09:58:21,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:21,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:21,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:22,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:25,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:25,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-18 09:58:25,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:25,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-18 09:58:25,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-18 09:58:25,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:58:25,221 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-02-18 09:58:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:25,746 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-02-18 09:58:25,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-18 09:58:25,747 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-02-18 09:58:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:25,748 INFO L225 Difference]: With dead ends: 167 [2019-02-18 09:58:25,748 INFO L226 Difference]: Without dead ends: 166 [2019-02-18 09:58:25,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:58:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-18 09:58:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-02-18 09:58:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-18 09:58:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-02-18 09:58:25,755 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-02-18 09:58:25,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:25,756 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-02-18 09:58:25,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-18 09:58:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-02-18 09:58:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-18 09:58:25,757 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:25,757 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-02-18 09:58:25,757 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:25,757 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2019-02-18 09:58:25,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:25,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:25,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:25,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:25,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:26,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:26,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:26,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:26,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:26,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:26,735 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 [2019-02-18 09:58:26,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:26,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:26,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:26,807 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 [2019-02-18 09:58:26,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:26,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:26,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:27,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:30,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:30,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-18 09:58:30,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:30,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-18 09:58:30,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-18 09:58:30,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-18 09:58:30,346 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-02-18 09:58:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:30,636 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-02-18 09:58:30,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-18 09:58:30,637 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-02-18 09:58:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:30,638 INFO L225 Difference]: With dead ends: 171 [2019-02-18 09:58:30,638 INFO L226 Difference]: Without dead ends: 170 [2019-02-18 09:58:30,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-18 09:58:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-18 09:58:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-02-18 09:58:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-18 09:58:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-02-18 09:58:30,644 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-02-18 09:58:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:30,645 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-02-18 09:58:30,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-18 09:58:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-02-18 09:58:30,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-18 09:58:30,646 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:30,646 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-02-18 09:58:30,646 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:30,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:30,646 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2019-02-18 09:58:30,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:30,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:30,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:30,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:30,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:31,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:31,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:31,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:31,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:31,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:31,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 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 [2019-02-18 09:58:31,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:31,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:31,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-18 09:58:31,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:31,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:31,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 [2019-02-18 09:58:31,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:31,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:31,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:33,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:35,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:35,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-18 09:58:35,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:35,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-18 09:58:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-18 09:58:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:58:35,636 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-02-18 09:58:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:35,917 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-02-18 09:58:35,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:58:35,917 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-02-18 09:58:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:35,918 INFO L225 Difference]: With dead ends: 175 [2019-02-18 09:58:35,918 INFO L226 Difference]: Without dead ends: 174 [2019-02-18 09:58:35,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:58:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-18 09:58:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-02-18 09:58:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-18 09:58:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-02-18 09:58:35,924 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-02-18 09:58:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:35,924 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-02-18 09:58:35,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-18 09:58:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-02-18 09:58:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-18 09:58:35,925 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:35,926 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-02-18 09:58:35,926 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2019-02-18 09:58:35,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:35,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:35,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:36,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:36,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:36,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:36,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:36,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:36,946 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 [2019-02-18 09:58:36,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:36,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:37,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:37,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:37,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:37,018 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 [2019-02-18 09:58:37,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:37,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:37,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:38,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:40,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:40,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-18 09:58:40,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:40,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-18 09:58:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-18 09:58:40,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-18 09:58:40,721 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-02-18 09:58:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:41,264 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-02-18 09:58:41,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-18 09:58:41,264 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-02-18 09:58:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:41,266 INFO L225 Difference]: With dead ends: 179 [2019-02-18 09:58:41,266 INFO L226 Difference]: Without dead ends: 178 [2019-02-18 09:58:41,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-18 09:58:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-02-18 09:58:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-02-18 09:58:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-18 09:58:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-02-18 09:58:41,271 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-02-18 09:58:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:41,272 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-02-18 09:58:41,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-18 09:58:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-02-18 09:58:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-18 09:58:41,272 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:41,273 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-02-18 09:58:41,273 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2019-02-18 09:58:41,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:41,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:41,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:41,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:41,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:43,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:43,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:43,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:43,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:43,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:43,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 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 [2019-02-18 09:58:43,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:43,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:43,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:43,997 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 [2019-02-18 09:58:43,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:44,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:44,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:45,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:48,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:48,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-18 09:58:48,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:48,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-18 09:58:48,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-18 09:58:48,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:58:48,039 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-02-18 09:58:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:48,333 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-02-18 09:58:48,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-18 09:58:48,334 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-02-18 09:58:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:48,335 INFO L225 Difference]: With dead ends: 183 [2019-02-18 09:58:48,335 INFO L226 Difference]: Without dead ends: 182 [2019-02-18 09:58:48,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:58:48,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-18 09:58:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-02-18 09:58:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-18 09:58:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-18 09:58:48,341 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-02-18 09:58:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:48,341 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-18 09:58:48,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-18 09:58:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-18 09:58:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-18 09:58:48,342 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:48,342 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-02-18 09:58:48,343 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:48,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2019-02-18 09:58:48,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:48,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:48,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:49,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:49,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:49,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:49,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:49,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:49,431 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 [2019-02-18 09:58:49,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:49,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:49,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-18 09:58:49,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:49,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:49,602 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 [2019-02-18 09:58:49,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:49,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:49,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:51,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:53,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:53,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-18 09:58:53,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:53,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-18 09:58:53,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-18 09:58:53,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-18 09:58:53,714 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-02-18 09:58:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:54,064 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-02-18 09:58:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:58:54,064 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-02-18 09:58:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:54,066 INFO L225 Difference]: With dead ends: 187 [2019-02-18 09:58:54,066 INFO L226 Difference]: Without dead ends: 186 [2019-02-18 09:58:54,067 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 [2019-02-18 09:58:54,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-02-18 09:58:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-02-18 09:58:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-18 09:58:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-02-18 09:58:54,073 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-02-18 09:58:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:54,073 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-02-18 09:58:54,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-18 09:58:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-02-18 09:58:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-18 09:58:54,074 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:54,074 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-02-18 09:58:54,075 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2019-02-18 09:58:54,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:54,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:54,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:54,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:54,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:55,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:55,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:55,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:55,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:55,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:55,251 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 [2019-02-18 09:58:55,263 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:55,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:55,316 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:55,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:55,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:55,326 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 [2019-02-18 09:58:55,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:55,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:55,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:56,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:59,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:59,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-18 09:58:59,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:59,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-18 09:58:59,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-18 09:58:59,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:58:59,465 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-02-18 09:58:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:59,803 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-02-18 09:58:59,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:58:59,803 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-02-18 09:58:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:59,805 INFO L225 Difference]: With dead ends: 191 [2019-02-18 09:58:59,805 INFO L226 Difference]: Without dead ends: 190 [2019-02-18 09:58:59,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:58:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-18 09:58:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-02-18 09:58:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-18 09:58:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-02-18 09:58:59,811 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-02-18 09:58:59,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:59,811 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-02-18 09:58:59,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-18 09:58:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-02-18 09:58:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-18 09:58:59,812 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:59,812 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-02-18 09:58:59,812 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:59,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:59,813 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2019-02-18 09:58:59,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:59,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:59,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:59,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:01,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:01,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:01,876 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:01,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:01,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:01,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 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 [2019-02-18 09:59:01,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:01,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:59:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:01,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:01,960 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 [2019-02-18 09:59:01,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:01,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:01,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:04,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:07,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:07,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-18 09:59:07,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:07,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-18 09:59:07,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-18 09:59:07,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-18 09:59:07,484 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-02-18 09:59:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:07,848 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-18 09:59:07,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-18 09:59:07,848 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-02-18 09:59:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:07,850 INFO L225 Difference]: With dead ends: 195 [2019-02-18 09:59:07,850 INFO L226 Difference]: Without dead ends: 194 [2019-02-18 09:59:07,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-18 09:59:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-18 09:59:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-02-18 09:59:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-18 09:59:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-02-18 09:59:07,858 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-02-18 09:59:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:07,858 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-02-18 09:59:07,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-18 09:59:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-02-18 09:59:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-18 09:59:07,860 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:07,860 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-02-18 09:59:07,860 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2019-02-18 09:59:07,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:07,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:07,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:07,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:07,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:09,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:09,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:09,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:09,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:09,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:09,124 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 [2019-02-18 09:59:09,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:09,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:09,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-18 09:59:09,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:09,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:09,328 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 [2019-02-18 09:59:09,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:09,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:09,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:11,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:11,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:14,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:14,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-18 09:59:14,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:14,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-18 09:59:14,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-18 09:59:14,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:59:14,080 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-02-18 09:59:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:14,504 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-02-18 09:59:14,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 09:59:14,504 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-02-18 09:59:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:14,505 INFO L225 Difference]: With dead ends: 199 [2019-02-18 09:59:14,505 INFO L226 Difference]: Without dead ends: 198 [2019-02-18 09:59:14,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:59:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-18 09:59:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-02-18 09:59:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-18 09:59:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-02-18 09:59:14,511 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-02-18 09:59:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:14,511 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-02-18 09:59:14,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-18 09:59:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-02-18 09:59:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-18 09:59:14,513 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:14,513 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-02-18 09:59:14,513 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2019-02-18 09:59:14,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:14,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:14,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:16,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:16,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:16,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:16,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:16,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:16,005 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 [2019-02-18 09:59:16,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:59:16,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:59:16,076 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:59:16,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:16,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:16,086 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 [2019-02-18 09:59:16,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:16,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:16,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:17,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:20,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:20,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-18 09:59:20,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:20,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-18 09:59:20,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-18 09:59:20,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-18 09:59:20,529 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-02-18 09:59:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:20,947 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-02-18 09:59:20,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-18 09:59:20,947 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-02-18 09:59:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:20,948 INFO L225 Difference]: With dead ends: 203 [2019-02-18 09:59:20,948 INFO L226 Difference]: Without dead ends: 202 [2019-02-18 09:59:20,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-18 09:59:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-02-18 09:59:20,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-02-18 09:59:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-18 09:59:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-02-18 09:59:20,955 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-02-18 09:59:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:20,955 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-02-18 09:59:20,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-18 09:59:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-02-18 09:59:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-18 09:59:20,956 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:20,956 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-02-18 09:59:20,956 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:20,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2019-02-18 09:59:20,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:20,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:20,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:20,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:22,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:22,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:22,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:22,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:22,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:22,463 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 [2019-02-18 09:59:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:22,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:59:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:22,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:22,536 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 [2019-02-18 09:59:22,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:22,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:22,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:24,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:27,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:27,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-18 09:59:27,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:27,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-18 09:59:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-18 09:59:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:59:27,523 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-02-18 09:59:27,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:27,854 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-02-18 09:59:27,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 09:59:27,854 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-02-18 09:59:27,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:27,856 INFO L225 Difference]: With dead ends: 207 [2019-02-18 09:59:27,856 INFO L226 Difference]: Without dead ends: 206 [2019-02-18 09:59:27,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:59:27,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-02-18 09:59:27,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-02-18 09:59:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-18 09:59:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-02-18 09:59:27,863 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-02-18 09:59:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:27,863 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-02-18 09:59:27,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-18 09:59:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-02-18 09:59:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-18 09:59:27,864 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:27,864 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-02-18 09:59:27,864 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:27,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:27,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2019-02-18 09:59:27,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:27,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:27,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:27,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:27,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:29,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:29,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:29,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:29,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:29,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:29,295 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 [2019-02-18 09:59:29,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:29,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:29,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-18 09:59:29,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:29,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:29,512 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 [2019-02-18 09:59:29,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:29,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:29,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:31,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:34,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:34,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-02-18 09:59:34,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:34,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-18 09:59:34,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-18 09:59:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-18 09:59:34,499 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-02-18 09:59:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:34,919 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-02-18 09:59:34,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-18 09:59:34,920 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-02-18 09:59:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:34,921 INFO L225 Difference]: With dead ends: 211 [2019-02-18 09:59:34,921 INFO L226 Difference]: Without dead ends: 210 [2019-02-18 09:59:34,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-18 09:59:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-02-18 09:59:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-02-18 09:59:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-18 09:59:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-02-18 09:59:34,928 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-02-18 09:59:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:34,928 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-02-18 09:59:34,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-18 09:59:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-02-18 09:59:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-18 09:59:34,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:34,930 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-02-18 09:59:34,930 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2019-02-18 09:59:34,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:34,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:34,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:34,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:34,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:36,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:36,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:36,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:36,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:36,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:36,887 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 [2019-02-18 09:59:36,895 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:59:36,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:59:36,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:59:36,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:36,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:36,996 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 [2019-02-18 09:59:36,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:37,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:37,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:40,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:43,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:43,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-02-18 09:59:43,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:43,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-18 09:59:43,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-18 09:59:43,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:59:43,793 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-02-18 09:59:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:44,238 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-02-18 09:59:44,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 09:59:44,238 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-02-18 09:59:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:44,240 INFO L225 Difference]: With dead ends: 215 [2019-02-18 09:59:44,240 INFO L226 Difference]: Without dead ends: 214 [2019-02-18 09:59:44,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:59:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-18 09:59:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-02-18 09:59:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-18 09:59:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-02-18 09:59:44,246 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-02-18 09:59:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:44,247 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-02-18 09:59:44,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-18 09:59:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-02-18 09:59:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-18 09:59:44,248 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:44,248 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-02-18 09:59:44,248 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2019-02-18 09:59:44,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:44,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:44,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:44,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:44,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:45,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:45,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:45,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:45,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:45,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:45,765 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 [2019-02-18 09:59:45,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:45,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:59:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:45,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:45,854 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 [2019-02-18 09:59:45,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:45,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:45,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:47,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:51,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:51,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-02-18 09:59:51,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:51,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-18 09:59:51,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-18 09:59:51,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-18 09:59:51,055 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-02-18 09:59:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:51,424 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-02-18 09:59:51,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 09:59:51,424 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-02-18 09:59:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:51,426 INFO L225 Difference]: With dead ends: 219 [2019-02-18 09:59:51,426 INFO L226 Difference]: Without dead ends: 218 [2019-02-18 09:59:51,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-18 09:59:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-02-18 09:59:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-02-18 09:59:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-18 09:59:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-02-18 09:59:51,432 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-02-18 09:59:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:51,432 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-02-18 09:59:51,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-18 09:59:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-02-18 09:59:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-18 09:59:51,434 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:51,434 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-02-18 09:59:51,434 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:51,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:51,434 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2019-02-18 09:59:51,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:51,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:51,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:52,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:52,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:52,966 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:52,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:52,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:52,967 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 [2019-02-18 09:59:52,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:52,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:53,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-18 09:59:53,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:53,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:53,219 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 [2019-02-18 09:59:53,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:53,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:53,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:54,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:58,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:58,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-02-18 09:59:58,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:58,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-18 09:59:58,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-18 09:59:58,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 09:59:58,486 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-02-18 09:59:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:58,872 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-02-18 09:59:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-18 09:59:58,873 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-02-18 09:59:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:58,874 INFO L225 Difference]: With dead ends: 223 [2019-02-18 09:59:58,874 INFO L226 Difference]: Without dead ends: 222 [2019-02-18 09:59:58,875 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 [2019-02-18 09:59:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-18 09:59:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-02-18 09:59:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-18 09:59:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-02-18 09:59:58,879 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-02-18 09:59:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:58,879 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-02-18 09:59:58,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-18 09:59:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-02-18 09:59:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-02-18 09:59:58,880 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:58,880 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-02-18 09:59:58,880 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:58,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:58,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2019-02-18 09:59:58,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:58,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:58,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:58,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:58,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:00,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:00,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:00,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:00,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:00,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:00,403 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 [2019-02-18 10:00:00,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:00:00,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:00:00,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:00:00,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:00,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:00,484 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 [2019-02-18 10:00:00,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:00,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:00,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:02,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:05,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:05,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-02-18 10:00:05,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:05,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-18 10:00:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-18 10:00:05,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-18 10:00:05,951 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-02-18 10:00:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:06,528 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-02-18 10:00:06,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-18 10:00:06,529 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-02-18 10:00:06,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:06,530 INFO L225 Difference]: With dead ends: 227 [2019-02-18 10:00:06,530 INFO L226 Difference]: Without dead ends: 226 [2019-02-18 10:00:06,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-18 10:00:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-18 10:00:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-02-18 10:00:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-18 10:00:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-02-18 10:00:06,537 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-02-18 10:00:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:06,538 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-02-18 10:00:06,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-18 10:00:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-02-18 10:00:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-02-18 10:00:06,539 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:06,539 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-02-18 10:00:06,539 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2019-02-18 10:00:06,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:06,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:06,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:06,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:08,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:08,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:08,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:08,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:08,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:08,204 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 [2019-02-18 10:00:08,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:08,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:00:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:08,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:08,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 [2019-02-18 10:00:08,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:08,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:08,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:10,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:13,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:13,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-02-18 10:00:13,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:13,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-18 10:00:13,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-18 10:00:13,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 10:00:13,729 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-02-18 10:00:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:14,203 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-02-18 10:00:14,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-18 10:00:14,204 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-02-18 10:00:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:14,206 INFO L225 Difference]: With dead ends: 231 [2019-02-18 10:00:14,206 INFO L226 Difference]: Without dead ends: 230 [2019-02-18 10:00:14,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 10:00:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-18 10:00:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-02-18 10:00:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-18 10:00:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-02-18 10:00:14,213 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-02-18 10:00:14,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:14,213 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-02-18 10:00:14,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-18 10:00:14,213 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-02-18 10:00:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-02-18 10:00:14,215 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:14,215 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-02-18 10:00:14,215 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:14,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:14,215 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2019-02-18 10:00:14,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:14,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:14,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:14,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:14,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:15,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:15,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:15,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:15,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:15,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:15,845 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 [2019-02-18 10:00:15,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:00:15,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:00:16,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-18 10:00:16,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:16,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:16,102 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 [2019-02-18 10:00:16,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:16,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:16,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:18,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:21,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:21,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-02-18 10:00:21,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:21,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-18 10:00:21,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-18 10:00:21,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-18 10:00:21,819 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-02-18 10:00:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:22,371 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-02-18 10:00:22,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-18 10:00:22,372 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-02-18 10:00:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:22,373 INFO L225 Difference]: With dead ends: 235 [2019-02-18 10:00:22,373 INFO L226 Difference]: Without dead ends: 234 [2019-02-18 10:00:22,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-18 10:00:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-18 10:00:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-02-18 10:00:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-02-18 10:00:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-02-18 10:00:22,380 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-02-18 10:00:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:22,381 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-02-18 10:00:22,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-18 10:00:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-02-18 10:00:22,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-02-18 10:00:22,382 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:22,382 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-02-18 10:00:22,383 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:22,383 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2019-02-18 10:00:22,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:22,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:22,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:22,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:22,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:24,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:24,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:24,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:24,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:24,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:24,043 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 [2019-02-18 10:00:24,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:00:24,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:00:24,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:00:24,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:24,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:24,143 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 [2019-02-18 10:00:24,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:24,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:24,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:26,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:29,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:29,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-02-18 10:00:29,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:29,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-18 10:00:29,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-18 10:00:29,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 10:00:29,979 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-02-18 10:00:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:30,447 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-02-18 10:00:30,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-18 10:00:30,447 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-02-18 10:00:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:30,449 INFO L225 Difference]: With dead ends: 239 [2019-02-18 10:00:30,449 INFO L226 Difference]: Without dead ends: 238 [2019-02-18 10:00:30,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 10:00:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-02-18 10:00:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-02-18 10:00:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-02-18 10:00:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-02-18 10:00:30,454 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-02-18 10:00:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:30,454 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-02-18 10:00:30,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-18 10:00:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-02-18 10:00:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-02-18 10:00:30,455 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:30,456 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-02-18 10:00:30,456 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:30,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:30,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2019-02-18 10:00:30,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:30,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:30,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:30,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:30,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:32,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:32,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:32,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:32,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:32,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:32,170 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 [2019-02-18 10:00:32,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:32,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:00:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:32,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:32,255 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 [2019-02-18 10:00:32,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:32,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:32,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:34,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:38,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:38,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-02-18 10:00:38,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:38,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-18 10:00:38,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-18 10:00:38,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-18 10:00:38,511 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-02-18 10:00:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:38,977 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-02-18 10:00:38,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-18 10:00:38,978 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-02-18 10:00:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:38,979 INFO L225 Difference]: With dead ends: 243 [2019-02-18 10:00:38,979 INFO L226 Difference]: Without dead ends: 242 [2019-02-18 10:00:38,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-18 10:00:38,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-02-18 10:00:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-02-18 10:00:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-18 10:00:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-18 10:00:38,983 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-02-18 10:00:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:38,984 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-18 10:00:38,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-18 10:00:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-18 10:00:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-18 10:00:38,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:38,985 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-02-18 10:00:38,985 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:38,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2019-02-18 10:00:38,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:38,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:38,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:40,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:40,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:40,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:40,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:40,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:40,735 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 [2019-02-18 10:00:40,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:00:40,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:00:40,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-18 10:00:40,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:41,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:41,013 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 [2019-02-18 10:00:41,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:41,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:41,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:43,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:46,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:46,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-02-18 10:00:46,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:46,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-18 10:00:46,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-18 10:00:46,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 10:00:46,951 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-02-18 10:00:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:47,439 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-02-18 10:00:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-18 10:00:47,439 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-02-18 10:00:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:47,441 INFO L225 Difference]: With dead ends: 247 [2019-02-18 10:00:47,441 INFO L226 Difference]: Without dead ends: 246 [2019-02-18 10:00:47,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 10:00:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-02-18 10:00:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-02-18 10:00:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-18 10:00:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-02-18 10:00:47,448 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-02-18 10:00:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:47,448 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-02-18 10:00:47,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-18 10:00:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-02-18 10:00:47,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-18 10:00:47,450 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:47,450 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-02-18 10:00:47,450 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2019-02-18 10:00:47,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:47,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:47,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:49,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:49,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:49,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:49,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:49,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:49,393 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 [2019-02-18 10:00:49,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:00:49,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:00:49,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:00:49,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:49,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:49,489 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 [2019-02-18 10:00:49,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:49,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:49,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:51,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:55,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:55,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-02-18 10:00:55,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:55,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-18 10:00:55,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-18 10:00:55,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-18 10:00:55,614 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-02-18 10:00:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:56,105 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-02-18 10:00:56,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-18 10:00:56,105 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-02-18 10:00:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:56,106 INFO L225 Difference]: With dead ends: 251 [2019-02-18 10:00:56,106 INFO L226 Difference]: Without dead ends: 250 [2019-02-18 10:00:56,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-18 10:00:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-18 10:00:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-02-18 10:00:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-02-18 10:00:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-02-18 10:00:56,114 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-02-18 10:00:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:56,114 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-02-18 10:00:56,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-18 10:00:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-02-18 10:00:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-02-18 10:00:56,116 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:56,116 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-02-18 10:00:56,116 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:56,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:56,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2019-02-18 10:00:56,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:56,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:56,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:56,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:56,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:58,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:58,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:58,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:58,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:58,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:58,139 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 [2019-02-18 10:00:58,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:58,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:00:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:58,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:58,223 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 [2019-02-18 10:00:58,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:58,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:58,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:00,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:04,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:04,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-02-18 10:01:04,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:04,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-18 10:01:04,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-18 10:01:04,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 10:01:04,290 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-02-18 10:01:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:04,744 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-18 10:01:04,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-18 10:01:04,745 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-02-18 10:01:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:04,746 INFO L225 Difference]: With dead ends: 255 [2019-02-18 10:01:04,746 INFO L226 Difference]: Without dead ends: 254 [2019-02-18 10:01:04,747 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 [2019-02-18 10:01:04,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-18 10:01:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-02-18 10:01:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-18 10:01:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-02-18 10:01:04,752 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-02-18 10:01:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:04,752 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-02-18 10:01:04,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-18 10:01:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-02-18 10:01:04,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-02-18 10:01:04,753 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:04,753 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-02-18 10:01:04,753 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:04,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2019-02-18 10:01:04,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:04,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:04,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:04,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:04,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:06,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:06,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:06,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:06,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:06,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:06,675 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 [2019-02-18 10:01:06,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:01:06,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:01:06,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-18 10:01:06,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:06,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:06,977 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 [2019-02-18 10:01:06,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:06,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:06,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:09,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:13,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:13,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-02-18 10:01:13,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:13,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-18 10:01:13,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-18 10:01:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-18 10:01:13,292 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-02-18 10:01:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:13,817 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-02-18 10:01:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-18 10:01:13,817 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-02-18 10:01:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:13,818 INFO L225 Difference]: With dead ends: 259 [2019-02-18 10:01:13,818 INFO L226 Difference]: Without dead ends: 258 [2019-02-18 10:01:13,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-18 10:01:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-18 10:01:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-02-18 10:01:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-02-18 10:01:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-02-18 10:01:13,823 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-02-18 10:01:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:13,823 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-02-18 10:01:13,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-18 10:01:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-02-18 10:01:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-02-18 10:01:13,824 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:13,824 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-02-18 10:01:13,825 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:13,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:13,825 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2019-02-18 10:01:13,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:13,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:13,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:15,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:15,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:15,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:15,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:15,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:15,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 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 [2019-02-18 10:01:15,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:01:15,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:01:15,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:01:15,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:15,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:15,884 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 [2019-02-18 10:01:15,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:15,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:15,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:18,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:22,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:22,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-02-18 10:01:22,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:22,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-18 10:01:22,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-18 10:01:22,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 10:01:22,202 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-02-18 10:01:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:22,674 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-02-18 10:01:22,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-18 10:01:22,674 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-02-18 10:01:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:22,675 INFO L225 Difference]: With dead ends: 263 [2019-02-18 10:01:22,675 INFO L226 Difference]: Without dead ends: 262 [2019-02-18 10:01:22,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 10:01:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-02-18 10:01:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-02-18 10:01:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-02-18 10:01:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-02-18 10:01:22,682 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-02-18 10:01:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:22,682 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-02-18 10:01:22,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-18 10:01:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-02-18 10:01:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-02-18 10:01:22,684 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:22,684 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-02-18 10:01:22,684 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:22,684 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2019-02-18 10:01:22,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:22,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:22,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:22,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:22,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:25,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:25,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:25,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:25,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:25,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:25,010 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 [2019-02-18 10:01:25,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:25,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:01:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:25,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:25,118 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 [2019-02-18 10:01:25,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:25,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:25,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:27,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:31,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:31,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-02-18 10:01:31,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:31,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-18 10:01:31,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-18 10:01:31,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-18 10:01:31,640 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-02-18 10:01:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:32,115 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-02-18 10:01:32,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-18 10:01:32,116 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-02-18 10:01:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:32,117 INFO L225 Difference]: With dead ends: 267 [2019-02-18 10:01:32,117 INFO L226 Difference]: Without dead ends: 266 [2019-02-18 10:01:32,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-18 10:01:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-02-18 10:01:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-02-18 10:01:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-02-18 10:01:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-02-18 10:01:32,124 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-02-18 10:01:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:32,125 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-02-18 10:01:32,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-18 10:01:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-02-18 10:01:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-02-18 10:01:32,126 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:32,127 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-02-18 10:01:32,127 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:32,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:32,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2019-02-18 10:01:32,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:32,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:32,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:32,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:32,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:34,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:34,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:34,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:34,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:34,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:34,737 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 [2019-02-18 10:01:34,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:01:34,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:01:35,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-18 10:01:35,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:35,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:35,063 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 [2019-02-18 10:01:35,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:35,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:35,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:37,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:41,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:41,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-02-18 10:01:41,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:41,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-18 10:01:41,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-18 10:01:41,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 10:01:41,647 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-02-18 10:01:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:42,209 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-02-18 10:01:42,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-18 10:01:42,209 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-02-18 10:01:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:42,210 INFO L225 Difference]: With dead ends: 271 [2019-02-18 10:01:42,210 INFO L226 Difference]: Without dead ends: 270 [2019-02-18 10:01:42,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 10:01:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-18 10:01:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-02-18 10:01:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-18 10:01:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-02-18 10:01:42,217 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-02-18 10:01:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:42,217 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-02-18 10:01:42,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-18 10:01:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-02-18 10:01:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-18 10:01:42,219 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:42,219 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-02-18 10:01:42,219 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:42,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:42,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2019-02-18 10:01:42,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:42,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:42,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:42,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:44,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:44,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:44,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:44,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:44,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:44,535 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 [2019-02-18 10:01:44,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:01:44,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:01:44,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:01:44,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:44,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:44,638 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 [2019-02-18 10:01:44,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:44,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:44,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:47,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:51,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:51,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-02-18 10:01:51,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:51,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-18 10:01:51,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-18 10:01:51,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-18 10:01:51,299 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-02-18 10:01:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:51,819 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-02-18 10:01:51,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-18 10:01:51,820 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-02-18 10:01:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:51,821 INFO L225 Difference]: With dead ends: 275 [2019-02-18 10:01:51,821 INFO L226 Difference]: Without dead ends: 274 [2019-02-18 10:01:51,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-18 10:01:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-18 10:01:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-02-18 10:01:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-18 10:01:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-02-18 10:01:51,827 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-02-18 10:01:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:51,827 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-02-18 10:01:51,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-18 10:01:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-02-18 10:01:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-18 10:01:51,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:51,829 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-02-18 10:01:51,829 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:51,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:51,829 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2019-02-18 10:01:51,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:51,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:51,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:54,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:54,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:54,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:54,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:54,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:54,039 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 [2019-02-18 10:01:54,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:54,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:01:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:54,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:54,146 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 [2019-02-18 10:01:54,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:54,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:54,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:57,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:01,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:01,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-02-18 10:02:01,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:01,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-18 10:02:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-18 10:02:01,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 10:02:01,245 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-02-18 10:02:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:01,855 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-02-18 10:02:01,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-18 10:02:01,855 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-02-18 10:02:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:01,856 INFO L225 Difference]: With dead ends: 279 [2019-02-18 10:02:01,856 INFO L226 Difference]: Without dead ends: 278 [2019-02-18 10:02:01,858 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 [2019-02-18 10:02:01,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-18 10:02:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-02-18 10:02:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-02-18 10:02:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-02-18 10:02:01,864 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-02-18 10:02:01,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:01,864 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-02-18 10:02:01,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-18 10:02:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-02-18 10:02:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-02-18 10:02:01,866 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:01,866 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-02-18 10:02:01,866 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:01,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2019-02-18 10:02:01,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:01,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:01,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:01,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:01,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:04,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:04,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:04,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:04,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:04,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:04,155 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 [2019-02-18 10:02:04,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:02:04,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:02:04,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-18 10:02:04,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:04,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:04,520 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 [2019-02-18 10:02:04,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:04,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:04,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:02:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:07,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:11,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:11,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-02-18 10:02:11,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:11,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-18 10:02:11,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-18 10:02:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-18 10:02:11,660 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-02-18 10:02:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:12,186 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-02-18 10:02:12,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-18 10:02:12,186 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-02-18 10:02:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:12,188 INFO L225 Difference]: With dead ends: 283 [2019-02-18 10:02:12,188 INFO L226 Difference]: Without dead ends: 282 [2019-02-18 10:02:12,189 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 [2019-02-18 10:02:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-02-18 10:02:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-02-18 10:02:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-02-18 10:02:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-02-18 10:02:12,195 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-02-18 10:02:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:12,195 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-02-18 10:02:12,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-18 10:02:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-02-18 10:02:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-02-18 10:02:12,197 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:12,197 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-02-18 10:02:12,197 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:12,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:12,197 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2019-02-18 10:02:12,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:12,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:12,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:12,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:12,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:14,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:14,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:14,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:14,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:14,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:14,620 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 [2019-02-18 10:02:14,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:02:14,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:02:14,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:02:14,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:14,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:14,725 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 [2019-02-18 10:02:14,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:14,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:14,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:02:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:17,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:21,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:21,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-02-18 10:02:21,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:21,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-18 10:02:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-18 10:02:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 10:02:21,945 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-02-18 10:02:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:22,501 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-02-18 10:02:22,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-18 10:02:22,501 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-02-18 10:02:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:22,502 INFO L225 Difference]: With dead ends: 287 [2019-02-18 10:02:22,502 INFO L226 Difference]: Without dead ends: 286 [2019-02-18 10:02:22,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 10:02:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-02-18 10:02:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-02-18 10:02:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-18 10:02:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-02-18 10:02:22,508 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-02-18 10:02:22,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:22,508 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-02-18 10:02:22,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-18 10:02:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-02-18 10:02:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-02-18 10:02:22,510 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:22,510 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-02-18 10:02:22,510 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:22,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2019-02-18 10:02:22,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:22,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:22,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:22,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:22,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:24,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:24,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:24,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:24,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:24,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:24,839 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 [2019-02-18 10:02:24,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:24,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:02:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:24,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:24,937 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 [2019-02-18 10:02:24,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:24,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:24,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:02:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:28,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:32,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:32,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-02-18 10:02:32,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:32,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-18 10:02:32,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-18 10:02:32,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-18 10:02:32,571 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-02-18 10:02:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:33,153 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-02-18 10:02:33,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-18 10:02:33,153 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-02-18 10:02:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:33,154 INFO L225 Difference]: With dead ends: 291 [2019-02-18 10:02:33,155 INFO L226 Difference]: Without dead ends: 290 [2019-02-18 10:02:33,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-18 10:02:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-02-18 10:02:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-02-18 10:02:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-02-18 10:02:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-02-18 10:02:33,160 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-02-18 10:02:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:33,161 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-02-18 10:02:33,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-18 10:02:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-02-18 10:02:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-02-18 10:02:33,162 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:33,162 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-02-18 10:02:33,162 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2019-02-18 10:02:33,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:33,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:33,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:33,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:33,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:35,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:35,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:35,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:35,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:35,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:35,844 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 [2019-02-18 10:02:35,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:02:35,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:02:36,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-18 10:02:36,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:36,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:36,230 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 [2019-02-18 10:02:36,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:36,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:36,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:02:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:39,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:43,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:43,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-02-18 10:02:43,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:43,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-18 10:02:43,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-18 10:02:43,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 10:02:43,425 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-02-18 10:02:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:44,022 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-02-18 10:02:44,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-18 10:02:44,022 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-02-18 10:02:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:44,024 INFO L225 Difference]: With dead ends: 295 [2019-02-18 10:02:44,024 INFO L226 Difference]: Without dead ends: 294 [2019-02-18 10:02:44,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 10:02:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-02-18 10:02:44,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-02-18 10:02:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-02-18 10:02:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-02-18 10:02:44,029 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-02-18 10:02:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:44,030 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-02-18 10:02:44,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-18 10:02:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-02-18 10:02:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-02-18 10:02:44,031 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:44,032 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-02-18 10:02:44,032 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:44,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:44,032 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2019-02-18 10:02:44,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:44,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:44,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:44,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:44,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:46,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:46,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:46,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:46,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:46,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:46,895 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 [2019-02-18 10:02:46,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:02:46,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:02:46,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:02:46,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:47,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:47,024 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 [2019-02-18 10:02:47,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:47,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:47,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:02:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:50,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:54,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:54,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-02-18 10:02:54,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:54,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-18 10:02:54,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-18 10:02:54,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-18 10:02:54,291 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-02-18 10:02:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:54,954 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-02-18 10:02:54,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-18 10:02:54,954 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-02-18 10:02:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:54,956 INFO L225 Difference]: With dead ends: 299 [2019-02-18 10:02:54,956 INFO L226 Difference]: Without dead ends: 298 [2019-02-18 10:02:54,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-18 10:02:54,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-02-18 10:02:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-02-18 10:02:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-02-18 10:02:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-02-18 10:02:54,962 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-02-18 10:02:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:54,962 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-02-18 10:02:54,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-18 10:02:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-02-18 10:02:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-02-18 10:02:54,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:54,963 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-02-18 10:02:54,963 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:54,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2019-02-18 10:02:54,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:54,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:54,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:54,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:54,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:58,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:58,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:58,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:58,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:58,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:58,065 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 [2019-02-18 10:02:58,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:58,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:02:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:58,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:58,168 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 [2019-02-18 10:02:58,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:58,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:58,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:03:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:01,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:05,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:05,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-02-18 10:03:05,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:05,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-18 10:03:05,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-18 10:03:05,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 10:03:05,714 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-02-18 10:03:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:06,303 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-02-18 10:03:06,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-18 10:03:06,304 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-02-18 10:03:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:06,305 INFO L225 Difference]: With dead ends: 303 [2019-02-18 10:03:06,305 INFO L226 Difference]: Without dead ends: 302 [2019-02-18 10:03:06,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 10:03:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-18 10:03:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-02-18 10:03:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-18 10:03:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-18 10:03:06,311 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-02-18 10:03:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:06,311 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-18 10:03:06,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-18 10:03:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-18 10:03:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-18 10:03:06,312 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:06,313 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-02-18 10:03:06,313 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:06,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:06,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2019-02-18 10:03:06,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:06,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:06,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:06,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:06,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:08,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:08,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:08,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:08,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:08,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:08,941 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 [2019-02-18 10:03:08,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:03:08,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:03:09,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-18 10:03:09,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:09,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:09,360 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 [2019-02-18 10:03:09,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:09,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:09,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:03:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:12,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:17,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:17,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-02-18 10:03:17,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:17,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-18 10:03:17,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-18 10:03:17,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-18 10:03:17,163 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-02-18 10:03:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:17,819 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-02-18 10:03:17,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-18 10:03:17,819 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-02-18 10:03:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:17,821 INFO L225 Difference]: With dead ends: 307 [2019-02-18 10:03:17,821 INFO L226 Difference]: Without dead ends: 306 [2019-02-18 10:03:17,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-18 10:03:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-02-18 10:03:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-02-18 10:03:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-02-18 10:03:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-02-18 10:03:17,827 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-02-18 10:03:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:17,827 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-02-18 10:03:17,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-18 10:03:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-02-18 10:03:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-02-18 10:03:17,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:17,828 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-02-18 10:03:17,828 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:17,829 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2019-02-18 10:03:17,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:17,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:17,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:03:17,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:17,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:20,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:20,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:20,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:20,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:20,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:20,581 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 [2019-02-18 10:03:20,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:03:20,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:03:20,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:03:20,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:20,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:20,715 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 [2019-02-18 10:03:20,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:20,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:20,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:03:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:24,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:28,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:28,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-02-18 10:03:28,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:28,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-18 10:03:28,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-18 10:03:28,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 10:03:28,814 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-02-18 10:03:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:29,450 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-02-18 10:03:29,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-18 10:03:29,451 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-02-18 10:03:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:29,452 INFO L225 Difference]: With dead ends: 311 [2019-02-18 10:03:29,452 INFO L226 Difference]: Without dead ends: 310 [2019-02-18 10:03:29,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 10:03:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-02-18 10:03:29,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-02-18 10:03:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-02-18 10:03:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-02-18 10:03:29,458 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-02-18 10:03:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:29,459 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-02-18 10:03:29,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-18 10:03:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-02-18 10:03:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-02-18 10:03:29,460 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:29,460 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-02-18 10:03:29,461 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2019-02-18 10:03:29,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:29,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:29,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:03:29,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:29,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:32,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:32,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:32,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:32,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:32,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:32,609 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 [2019-02-18 10:03:32,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:32,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:03:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:32,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:32,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 [2019-02-18 10:03:32,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:32,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:32,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:03:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:36,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:40,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:40,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-02-18 10:03:40,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:40,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-18 10:03:40,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-18 10:03:40,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-18 10:03:40,375 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-02-18 10:03:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:41,024 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-02-18 10:03:41,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-18 10:03:41,025 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-02-18 10:03:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:41,026 INFO L225 Difference]: With dead ends: 315 [2019-02-18 10:03:41,026 INFO L226 Difference]: Without dead ends: 314 [2019-02-18 10:03:41,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-18 10:03:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-18 10:03:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-02-18 10:03:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-02-18 10:03:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-02-18 10:03:41,032 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-02-18 10:03:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:41,032 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-02-18 10:03:41,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-18 10:03:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-02-18 10:03:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-02-18 10:03:41,033 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:41,033 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-02-18 10:03:41,034 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:41,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2019-02-18 10:03:41,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:41,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:41,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:41,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:41,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:44,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:44,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:44,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:44,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:44,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:44,173 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 [2019-02-18 10:03:44,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:03:44,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:03:44,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-18 10:03:44,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:44,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:44,628 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 [2019-02-18 10:03:44,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:44,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:44,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:03:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:48,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:52,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:52,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-02-18 10:03:52,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:52,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-18 10:03:52,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-18 10:03:52,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 10:03:52,750 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-02-18 10:03:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:53,397 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-02-18 10:03:53,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-18 10:03:53,397 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-02-18 10:03:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:53,399 INFO L225 Difference]: With dead ends: 319 [2019-02-18 10:03:53,399 INFO L226 Difference]: Without dead ends: 318 [2019-02-18 10:03:53,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 10:03:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-02-18 10:03:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-02-18 10:03:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-02-18 10:03:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-02-18 10:03:53,404 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-02-18 10:03:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:53,405 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-02-18 10:03:53,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-18 10:03:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-02-18 10:03:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-02-18 10:03:53,406 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:53,406 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-02-18 10:03:53,406 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:53,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:53,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2019-02-18 10:03:53,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:53,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:53,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:03:53,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:53,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:56,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:56,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:56,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:56,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:56,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:56,394 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 [2019-02-18 10:03:56,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:03:56,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:03:56,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:03:56,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:56,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:56,531 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 [2019-02-18 10:03:56,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:56,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:56,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:04:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:00,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:04,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:04,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-02-18 10:04:04,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:04,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-18 10:04:04,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-18 10:04:04,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-18 10:04:04,501 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-02-18 10:04:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:05,220 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-02-18 10:04:05,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-18 10:04:05,221 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-02-18 10:04:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:05,222 INFO L225 Difference]: With dead ends: 323 [2019-02-18 10:04:05,222 INFO L226 Difference]: Without dead ends: 322 [2019-02-18 10:04:05,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-18 10:04:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-02-18 10:04:05,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-02-18 10:04:05,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-02-18 10:04:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-02-18 10:04:05,228 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-02-18 10:04:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:05,228 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-02-18 10:04:05,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-18 10:04:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-02-18 10:04:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-02-18 10:04:05,230 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:05,230 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-02-18 10:04:05,230 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:05,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:05,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2019-02-18 10:04:05,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:05,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:05,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:05,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:05,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:08,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:08,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:08,464 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:08,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:08,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:08,465 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 [2019-02-18 10:04:08,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:08,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:04:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:08,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:08,572 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 [2019-02-18 10:04:08,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:08,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:08,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:04:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:12,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:16,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:16,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-02-18 10:04:16,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:16,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-18 10:04:16,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-18 10:04:16,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 10:04:16,714 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-02-18 10:04:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:17,399 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-02-18 10:04:17,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-18 10:04:17,399 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-02-18 10:04:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:17,401 INFO L225 Difference]: With dead ends: 327 [2019-02-18 10:04:17,401 INFO L226 Difference]: Without dead ends: 326 [2019-02-18 10:04:17,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 10:04:17,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-02-18 10:04:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-02-18 10:04:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-02-18 10:04:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-02-18 10:04:17,407 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-02-18 10:04:17,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:17,407 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-02-18 10:04:17,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-18 10:04:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-02-18 10:04:17,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-02-18 10:04:17,409 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:17,409 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-02-18 10:04:17,409 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:17,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:17,409 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2019-02-18 10:04:17,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:17,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:17,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:20,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:20,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:20,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:20,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:20,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:20,765 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 [2019-02-18 10:04:20,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:04:20,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:04:21,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-18 10:04:21,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:21,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:21,270 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 [2019-02-18 10:04:21,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:21,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:21,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:04:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:25,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:29,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:29,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-02-18 10:04:29,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:29,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-18 10:04:29,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-18 10:04:29,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-18 10:04:29,576 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-02-18 10:04:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:30,310 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-02-18 10:04:30,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-18 10:04:30,310 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-02-18 10:04:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:30,312 INFO L225 Difference]: With dead ends: 331 [2019-02-18 10:04:30,312 INFO L226 Difference]: Without dead ends: 330 [2019-02-18 10:04:30,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-18 10:04:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-02-18 10:04:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-02-18 10:04:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-18 10:04:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-02-18 10:04:30,318 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-02-18 10:04:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:30,319 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-02-18 10:04:30,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-18 10:04:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-02-18 10:04:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-02-18 10:04:30,320 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:30,320 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-02-18 10:04:30,320 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:30,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:30,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2019-02-18 10:04:30,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:30,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:30,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:30,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:30,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:34,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:34,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:34,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:34,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:34,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:34,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 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 [2019-02-18 10:04:34,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:04:34,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:04:34,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:04:34,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:34,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:34,134 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 [2019-02-18 10:04:34,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:34,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:34,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:04:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:38,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:42,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:42,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-02-18 10:04:42,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:42,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-18 10:04:42,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-18 10:04:42,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 10:04:42,457 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-02-18 10:04:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:43,158 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-02-18 10:04:43,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-18 10:04:43,158 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-02-18 10:04:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:43,160 INFO L225 Difference]: With dead ends: 335 [2019-02-18 10:04:43,160 INFO L226 Difference]: Without dead ends: 334 [2019-02-18 10:04:43,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 10:04:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-02-18 10:04:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-02-18 10:04:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-02-18 10:04:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-02-18 10:04:43,167 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-02-18 10:04:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:43,167 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-02-18 10:04:43,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-18 10:04:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-02-18 10:04:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-02-18 10:04:43,168 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:43,168 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-02-18 10:04:43,169 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2019-02-18 10:04:43,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:43,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:43,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:43,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:43,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:46,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:46,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:46,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:46,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:46,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:46,717 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 [2019-02-18 10:04:46,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:46,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:04:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:46,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:46,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 [2019-02-18 10:04:46,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:46,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:46,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:04:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:51,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:55,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:55,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-02-18 10:04:55,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:55,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-18 10:04:55,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-18 10:04:55,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-18 10:04:55,554 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-02-18 10:04:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:56,228 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-02-18 10:04:56,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-18 10:04:56,228 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-02-18 10:04:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:56,230 INFO L225 Difference]: With dead ends: 339 [2019-02-18 10:04:56,230 INFO L226 Difference]: Without dead ends: 338 [2019-02-18 10:04:56,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-18 10:04:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-02-18 10:04:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-02-18 10:04:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-02-18 10:04:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-02-18 10:04:56,237 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-02-18 10:04:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:56,237 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-02-18 10:04:56,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-18 10:04:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-02-18 10:04:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-02-18 10:04:56,238 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:56,238 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-02-18 10:04:56,238 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2019-02-18 10:04:56,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:56,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:56,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:56,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:56,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:59,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:59,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:59,955 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:59,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:59,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:59,955 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 [2019-02-18 10:04:59,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:04:59,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:05:00,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-18 10:05:00,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:05:00,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:00,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 [2019-02-18 10:05:00,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:05:00,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:05:00,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:05:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:04,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:09,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:09,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-02-18 10:05:09,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:09,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-18 10:05:09,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-18 10:05:09,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 10:05:09,425 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-02-18 10:05:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:10,209 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-02-18 10:05:10,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-18 10:05:10,209 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-02-18 10:05:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:10,211 INFO L225 Difference]: With dead ends: 343 [2019-02-18 10:05:10,211 INFO L226 Difference]: Without dead ends: 342 [2019-02-18 10:05:10,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 10:05:10,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-18 10:05:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-02-18 10:05:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-18 10:05:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-02-18 10:05:10,216 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-02-18 10:05:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:10,216 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-02-18 10:05:10,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-18 10:05:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-02-18 10:05:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-02-18 10:05:10,218 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:10,218 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-02-18 10:05:10,218 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:05:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:10,218 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2019-02-18 10:05:10,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:10,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:10,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:05:10,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:10,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:13,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:13,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:05:13,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:05:13,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:05:13,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:13,558 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 [2019-02-18 10:05:13,568 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:05:13,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:05:13,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:05:13,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:05:13,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:13,689 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 [2019-02-18 10:05:13,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:05:13,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:05:13,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:05:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:18,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:22,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:22,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-02-18 10:05:22,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:22,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-02-18 10:05:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-02-18 10:05:22,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-18 10:05:22,626 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-02-18 10:05:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:23,445 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-02-18 10:05:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-18 10:05:23,446 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-02-18 10:05:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:23,448 INFO L225 Difference]: With dead ends: 347 [2019-02-18 10:05:23,448 INFO L226 Difference]: Without dead ends: 346 [2019-02-18 10:05:23,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-18 10:05:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-02-18 10:05:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-02-18 10:05:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-02-18 10:05:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-02-18 10:05:23,455 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-02-18 10:05:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:23,455 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-02-18 10:05:23,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-02-18 10:05:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-02-18 10:05:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-02-18 10:05:23,457 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:23,457 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-02-18 10:05:23,457 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:05:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:23,458 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2019-02-18 10:05:23,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:23,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:23,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:05:23,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:23,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:27,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:27,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:05:27,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:05:27,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:05:27,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:27,215 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 [2019-02-18 10:05:27,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:05:27,225 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:05:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:27,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:27,327 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 [2019-02-18 10:05:27,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:05:27,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:05:27,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:05:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:31,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:36,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:36,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-02-18 10:05:36,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:36,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-02-18 10:05:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-02-18 10:05:36,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-18 10:05:36,248 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-02-18 10:05:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:37,097 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-02-18 10:05:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-18 10:05:37,097 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-02-18 10:05:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:37,099 INFO L225 Difference]: With dead ends: 351 [2019-02-18 10:05:37,099 INFO L226 Difference]: Without dead ends: 350 [2019-02-18 10:05:37,100 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 [2019-02-18 10:05:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-02-18 10:05:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-02-18 10:05:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-02-18 10:05:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-02-18 10:05:37,106 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-02-18 10:05:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:37,106 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-02-18 10:05:37,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-02-18 10:05:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-02-18 10:05:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-02-18 10:05:37,108 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:37,108 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-02-18 10:05:37,108 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:05:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2019-02-18 10:05:37,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:37,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:37,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:05:37,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:37,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:40,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:40,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:05:40,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:05:40,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:05:40,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:40,884 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 [2019-02-18 10:05:40,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:05:40,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:05:41,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-02-18 10:05:41,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:05:41,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:41,452 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 [2019-02-18 10:05:41,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:05:41,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:05:41,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:05:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:46,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:50,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:50,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-02-18 10:05:50,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:50,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-02-18 10:05:50,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-02-18 10:05:50,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-18 10:05:50,695 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-02-18 10:05:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:51,481 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-02-18 10:05:51,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-18 10:05:51,482 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-02-18 10:05:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:51,484 INFO L225 Difference]: With dead ends: 355 [2019-02-18 10:05:51,484 INFO L226 Difference]: Without dead ends: 354 [2019-02-18 10:05:51,486 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 [2019-02-18 10:05:51,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-02-18 10:05:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-02-18 10:05:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-02-18 10:05:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-02-18 10:05:51,491 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-02-18 10:05:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:51,491 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-02-18 10:05:51,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-02-18 10:05:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-02-18 10:05:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-02-18 10:05:51,492 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:51,493 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-02-18 10:05:51,493 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:05:51,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2019-02-18 10:05:51,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:51,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:05:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:51,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:55,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:55,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:05:55,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:05:55,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:05:55,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:55,820 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 [2019-02-18 10:05:55,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:05:55,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:05:55,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:05:55,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:05:55,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:55,950 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 [2019-02-18 10:05:55,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:05:55,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:05:55,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:06:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:00,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:04,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:04,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-02-18 10:06:04,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:04,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-02-18 10:06:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-02-18 10:06:04,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 10:06:04,856 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-02-18 10:06:05,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:05,672 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-02-18 10:06:05,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-18 10:06:05,673 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-02-18 10:06:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:05,674 INFO L225 Difference]: With dead ends: 359 [2019-02-18 10:06:05,674 INFO L226 Difference]: Without dead ends: 358 [2019-02-18 10:06:05,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 10:06:05,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-18 10:06:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-02-18 10:06:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-02-18 10:06:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-02-18 10:06:05,680 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-02-18 10:06:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:05,681 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-02-18 10:06:05,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-02-18 10:06:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-02-18 10:06:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-02-18 10:06:05,682 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:05,682 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-02-18 10:06:05,682 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2019-02-18 10:06:05,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:05,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:05,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:06:05,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:05,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:09,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:09,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:09,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:06:09,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:06:09,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:09,365 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 [2019-02-18 10:06:09,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:09,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:09,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:09,483 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 [2019-02-18 10:06:09,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:09,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:09,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:06:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:14,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:18,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:18,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-02-18 10:06:18,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:18,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-02-18 10:06:18,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-02-18 10:06:18,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-18 10:06:18,717 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2019-02-18 10:06:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:19,615 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-02-18 10:06:19,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-18 10:06:19,615 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2019-02-18 10:06:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:19,617 INFO L225 Difference]: With dead ends: 363 [2019-02-18 10:06:19,617 INFO L226 Difference]: Without dead ends: 362 [2019-02-18 10:06:19,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-18 10:06:19,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-18 10:06:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-02-18 10:06:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-02-18 10:06:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-02-18 10:06:19,625 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-02-18 10:06:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:19,625 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-02-18 10:06:19,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-02-18 10:06:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-02-18 10:06:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-02-18 10:06:19,626 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:19,627 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-02-18 10:06:19,627 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2019-02-18 10:06:19,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:19,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:19,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:19,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:19,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:23,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:23,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:23,818 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:06:23,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:06:23,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:23,818 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 [2019-02-18 10:06:23,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:06:23,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:06:24,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-02-18 10:06:24,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:06:24,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:24,416 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 [2019-02-18 10:06:24,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:24,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:24,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:06:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:29,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:33,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:33,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-02-18 10:06:33,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:33,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-02-18 10:06:33,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-02-18 10:06:33,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 10:06:33,836 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2019-02-18 10:06:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:34,661 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-02-18 10:06:34,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-18 10:06:34,661 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2019-02-18 10:06:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:34,664 INFO L225 Difference]: With dead ends: 367 [2019-02-18 10:06:34,664 INFO L226 Difference]: Without dead ends: 366 [2019-02-18 10:06:34,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 10:06:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-18 10:06:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-02-18 10:06:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-02-18 10:06:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-02-18 10:06:34,670 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-02-18 10:06:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:34,671 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-02-18 10:06:34,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-02-18 10:06:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-02-18 10:06:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-02-18 10:06:34,672 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:34,672 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-02-18 10:06:34,672 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:34,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:34,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2019-02-18 10:06:34,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:34,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:34,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:06:34,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:34,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:38,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:38,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:38,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:06:38,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:06:38,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:38,815 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 [2019-02-18 10:06:38,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:06:38,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:06:38,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:06:38,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:06:38,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:38,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 [2019-02-18 10:06:38,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:38,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:38,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:06:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:43,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:48,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:48,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-02-18 10:06:48,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:48,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-02-18 10:06:48,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-02-18 10:06:48,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-18 10:06:48,476 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2019-02-18 10:06:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:49,232 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-02-18 10:06:49,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-18 10:06:49,232 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2019-02-18 10:06:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:49,233 INFO L225 Difference]: With dead ends: 371 [2019-02-18 10:06:49,233 INFO L226 Difference]: Without dead ends: 370 [2019-02-18 10:06:49,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-18 10:06:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-02-18 10:06:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-02-18 10:06:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-02-18 10:06:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-02-18 10:06:49,240 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-02-18 10:06:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:49,240 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-02-18 10:06:49,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-02-18 10:06:49,240 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-02-18 10:06:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-02-18 10:06:49,242 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:49,242 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-02-18 10:06:49,242 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:49,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:49,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2019-02-18 10:06:49,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:49,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:49,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:06:49,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:49,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:53,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:53,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:53,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:06:53,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:06:53,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:53,320 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 [2019-02-18 10:06:53,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:53,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:53,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:53,438 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 [2019-02-18 10:06:53,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:53,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:53,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:06:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:58,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:02,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:02,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-02-18 10:07:02,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:02,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-02-18 10:07:02,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-02-18 10:07:02,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 10:07:02,808 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2019-02-18 10:07:03,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:03,603 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-02-18 10:07:03,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-18 10:07:03,604 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2019-02-18 10:07:03,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:03,605 INFO L225 Difference]: With dead ends: 375 [2019-02-18 10:07:03,605 INFO L226 Difference]: Without dead ends: 374 [2019-02-18 10:07:03,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 10:07:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-18 10:07:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-02-18 10:07:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-02-18 10:07:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-02-18 10:07:03,612 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-02-18 10:07:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:03,613 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-02-18 10:07:03,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-02-18 10:07:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-02-18 10:07:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-02-18 10:07:03,614 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:03,614 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-02-18 10:07:03,614 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:03,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2019-02-18 10:07:03,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:03,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:03,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:03,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:07,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:07,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:07,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:07,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:07,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:07,858 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 [2019-02-18 10:07:07,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:07,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:08,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-02-18 10:07:08,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:08,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:08,483 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 [2019-02-18 10:07:08,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:08,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:08,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:07:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:13,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:18,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:18,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-02-18 10:07:18,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:18,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-02-18 10:07:18,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-02-18 10:07:18,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-18 10:07:18,355 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2019-02-18 10:07:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:19,137 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-02-18 10:07:19,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-18 10:07:19,138 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2019-02-18 10:07:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:19,139 INFO L225 Difference]: With dead ends: 379 [2019-02-18 10:07:19,140 INFO L226 Difference]: Without dead ends: 378 [2019-02-18 10:07:19,140 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 [2019-02-18 10:07:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-02-18 10:07:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-02-18 10:07:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-02-18 10:07:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-02-18 10:07:19,146 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-02-18 10:07:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:19,146 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-02-18 10:07:19,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-02-18 10:07:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-02-18 10:07:19,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-02-18 10:07:19,147 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:19,148 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-02-18 10:07:19,148 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:19,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:19,148 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2019-02-18 10:07:19,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:19,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:19,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:19,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:19,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:23,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:23,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:23,573 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:23,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:23,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:23,573 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 [2019-02-18 10:07:23,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:07:23,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:07:23,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:07:23,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:23,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:23,713 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 [2019-02-18 10:07:23,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:07:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:28,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:33,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:33,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-02-18 10:07:33,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:33,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-02-18 10:07:33,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-02-18 10:07:33,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 10:07:33,362 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2019-02-18 10:07:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:34,080 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2019-02-18 10:07:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-18 10:07:34,081 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2019-02-18 10:07:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:34,083 INFO L225 Difference]: With dead ends: 383 [2019-02-18 10:07:34,083 INFO L226 Difference]: Without dead ends: 382 [2019-02-18 10:07:34,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 10:07:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-02-18 10:07:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-02-18 10:07:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-02-18 10:07:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-02-18 10:07:34,090 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-02-18 10:07:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:34,090 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-02-18 10:07:34,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-02-18 10:07:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-02-18 10:07:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-02-18 10:07:34,092 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:34,092 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-02-18 10:07:34,092 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2019-02-18 10:07:34,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:34,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:34,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:38,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:38,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:38,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:38,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:38,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:38,661 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 [2019-02-18 10:07:38,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:38,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:38,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:38,789 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 [2019-02-18 10:07:38,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:38,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:38,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:07:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:44,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:48,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:48,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-02-18 10:07:48,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:48,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-02-18 10:07:48,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-02-18 10:07:48,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-18 10:07:48,595 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2019-02-18 10:07:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:49,431 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2019-02-18 10:07:49,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-18 10:07:49,431 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2019-02-18 10:07:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:49,433 INFO L225 Difference]: With dead ends: 387 [2019-02-18 10:07:49,433 INFO L226 Difference]: Without dead ends: 386 [2019-02-18 10:07:49,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 568 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-18 10:07:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-02-18 10:07:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-02-18 10:07:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-02-18 10:07:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-02-18 10:07:49,441 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-02-18 10:07:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:49,441 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-02-18 10:07:49,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-02-18 10:07:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-02-18 10:07:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-02-18 10:07:49,443 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:49,443 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-02-18 10:07:49,444 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2019-02-18 10:07:49,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:49,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:49,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:49,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:49,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:53,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:53,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:53,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:53,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:53,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:53,840 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 [2019-02-18 10:07:53,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:53,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:54,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-02-18 10:07:54,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:54,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:54,545 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 [2019-02-18 10:07:54,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:54,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:54,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:07:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:59,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:04,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:04,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-02-18 10:08:04,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:04,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-02-18 10:08:04,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-02-18 10:08:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-18 10:08:04,343 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2019-02-18 10:08:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:05,194 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-02-18 10:08:05,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-18 10:08:05,194 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2019-02-18 10:08:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:05,196 INFO L225 Difference]: With dead ends: 391 [2019-02-18 10:08:05,196 INFO L226 Difference]: Without dead ends: 390 [2019-02-18 10:08:05,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 574 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-18 10:08:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-02-18 10:08:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-02-18 10:08:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-02-18 10:08:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-02-18 10:08:05,203 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-02-18 10:08:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:05,203 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-02-18 10:08:05,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-02-18 10:08:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-02-18 10:08:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-02-18 10:08:05,205 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:05,205 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-02-18 10:08:05,205 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:05,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:05,205 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2019-02-18 10:08:05,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:05,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:05,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:08:05,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:05,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:09,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:09,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:09,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:08:09,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:08:09,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:09,754 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 [2019-02-18 10:08:09,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:08:09,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:08:09,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:08:09,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:08:09,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:09,896 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 [2019-02-18 10:08:09,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:08:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:15,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:19,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:19,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-02-18 10:08:19,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:19,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-02-18 10:08:19,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-02-18 10:08:19,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-18 10:08:19,897 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2019-02-18 10:08:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:20,779 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-02-18 10:08:20,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-18 10:08:20,780 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2019-02-18 10:08:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:20,781 INFO L225 Difference]: With dead ends: 395 [2019-02-18 10:08:20,781 INFO L226 Difference]: Without dead ends: 394 [2019-02-18 10:08:20,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 580 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-18 10:08:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-02-18 10:08:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-02-18 10:08:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-02-18 10:08:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-02-18 10:08:20,788 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-02-18 10:08:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:20,789 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-02-18 10:08:20,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-02-18 10:08:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-02-18 10:08:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-02-18 10:08:20,790 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:20,790 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-02-18 10:08:20,791 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:20,791 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2019-02-18 10:08:20,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:20,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:20,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:08:20,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:20,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:25,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:25,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:25,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:08:25,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:08:25,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:25,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 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 [2019-02-18 10:08:25,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:25,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:26,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:26,018 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 [2019-02-18 10:08:26,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:26,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:26,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:08:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:31,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:36,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:36,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-02-18 10:08:36,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:36,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-02-18 10:08:36,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-02-18 10:08:36,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-18 10:08:36,176 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2019-02-18 10:08:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:36,988 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2019-02-18 10:08:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-18 10:08:36,988 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2019-02-18 10:08:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:36,990 INFO L225 Difference]: With dead ends: 399 [2019-02-18 10:08:36,991 INFO L226 Difference]: Without dead ends: 398 [2019-02-18 10:08:36,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 586 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-18 10:08:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-02-18 10:08:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-02-18 10:08:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-02-18 10:08:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-02-18 10:08:36,997 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-02-18 10:08:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:36,997 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-02-18 10:08:36,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-02-18 10:08:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-02-18 10:08:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-02-18 10:08:36,999 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:36,999 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-02-18 10:08:36,999 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:36,999 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2019-02-18 10:08:36,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:37,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:37,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:37,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:37,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:41,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:41,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:41,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:08:41,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:08:41,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:41,593 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 [2019-02-18 10:08:41,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:08:41,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:08:42,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-02-18 10:08:42,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:08:42,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:42,337 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 [2019-02-18 10:08:42,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:42,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:42,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:08:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:48,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:52,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:52,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-02-18 10:08:52,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:52,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-02-18 10:08:52,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-02-18 10:08:52,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-18 10:08:52,661 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2019-02-18 10:08:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:53,491 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2019-02-18 10:08:53,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-18 10:08:53,497 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2019-02-18 10:08:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:53,499 INFO L225 Difference]: With dead ends: 403 [2019-02-18 10:08:53,499 INFO L226 Difference]: Without dead ends: 402 [2019-02-18 10:08:53,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 592 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-18 10:08:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-18 10:08:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-02-18 10:08:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-02-18 10:08:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-02-18 10:08:53,508 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-02-18 10:08:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:53,509 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-02-18 10:08:53,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-02-18 10:08:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-02-18 10:08:53,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-02-18 10:08:53,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:53,511 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-02-18 10:08:53,512 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:53,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:53,512 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2019-02-18 10:08:53,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:53,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:53,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:08:53,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:53,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:58,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:58,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:58,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:08:58,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:08:58,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:58,448 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 [2019-02-18 10:08:58,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:08:58,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:08:58,603 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:08:58,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:08:58,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:58,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 [2019-02-18 10:08:58,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:58,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:58,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:09:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:04,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:09:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:08,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:09:08,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-02-18 10:09:08,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:09:08,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-02-18 10:09:08,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-02-18 10:09:08,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 10:09:08,726 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2019-02-18 10:09:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:09,700 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2019-02-18 10:09:09,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-18 10:09:09,701 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2019-02-18 10:09:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:09,702 INFO L225 Difference]: With dead ends: 407 [2019-02-18 10:09:09,702 INFO L226 Difference]: Without dead ends: 406 [2019-02-18 10:09:09,703 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 [2019-02-18 10:09:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-02-18 10:09:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-02-18 10:09:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-02-18 10:09:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-02-18 10:09:09,710 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2019-02-18 10:09:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:09:09,710 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2019-02-18 10:09:09,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-02-18 10:09:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2019-02-18 10:09:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-02-18 10:09:09,712 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:09:09,713 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2019-02-18 10:09:09,713 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:09:09,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:09,713 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2019-02-18 10:09:09,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:09:09,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:09,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:09:09,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:09,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:09:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:14,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:14,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:09:14,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:09:14,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:09:14,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:14,265 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 [2019-02-18 10:09:14,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:14,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:09:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:14,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:09:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:14,565 INFO L316 TraceCheckSpWp]: Computing backward predicates...